Algorithms | Graph Shortest Paths | Question 11

Last Updated :
Discuss
Comments

Given a directed graph where weight of every edge is same, we can efficiently find shortest path from a given source to destination using?
 

Breadth First Traversal

Dijkstra\'s Shortest Path Algorithm

Neither Breadth First Traversal nor Dijkstra\'s algorithm can be used

Depth First Search

This question is part of this quiz :

Top MCQs on Shortest Paths in Graphs with Answers
Tags:
DSA Quiz
Share your thoughts in the comments
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy