Open In App

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

Algorithms | Graph Shortest Paths | Question 11

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

(A)



Breadth First Traversal

(B)



Dijkstra\’s Shortest Path Algorithm

(C)

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

(D)

Depth First Search

Answer: (A)
Explanation:

With BFS, we first find explore vertices at one edge distance, then all vertices at 2 edge distance, and so on.
 

Quiz of this Question
Please comment below if you find anything wrong in the above post

Article Tags :
DSA Quiz
Recommended Articles
1. Algorithms | Graph Shortest Paths | Question 14
2. Algorithms | Graph Shortest Paths | Question 2
3. Algorithms | Graph Shortest Paths | Question 3
4. Algorithms | Graph Shortest Paths | Question 4
5. Algorithms | Graph Shortest Paths | Question 14
6. Algorithms | Graph Shortest Paths | Question 8
7. Algorithms | Graph Shortest Paths | Question 9
8. Algorithms | Graph Shortest Paths | Question 10
9. Algorithms | Graph Shortest Paths | Question 12
10. Algorithms | Graph Shortest Paths | Question 13
11. Algorithms | Graph Shortest Paths | Question 14
12. Algorithms | Graph Shortest Paths | Question 15
13. Algorithms | Graph Shortest Paths | Question 7
14. Johnson’s algorithm for All-pairs shortest paths | Implementation
15. Number of paths from source to destination in a directed acyclic graph
16. Building an undirected graph and finding shortest path using Dictionaries in Python
17. Create a Graph by connecting divisors from N to M and find shortest path
18. Shortest path in a complement graph
19. Shortest path in a directed graph by Dijkstra’s algorithm
20. Algorithms | Graph Traversals | Question 2
21. Algorithms | Graph Minimum Spanning Tree | Question 1
22. Algorithms | Graph Minimum Spanning Tree | Question 2
23. Algorithms | Graph Minimum Spanning Tree | Question 3
24. Algorithms | Graph Minimum Spanning Tree | Question 4
25. Algorithms | Graph Minimum Spanning Tree | Question 5