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
Recommended Posts:
- Algorithms | Graph Shortest Paths | Question 14
- Algorithms | Graph Shortest Paths | Question 2
- Algorithms | Graph Shortest Paths | Question 3
- Algorithms | Graph Shortest Paths | Question 4
- Algorithms | Graph Shortest Paths | Question 14
- Algorithms | Graph Shortest Paths | Question 7
- Algorithms | Graph Shortest Paths | Question 8
- Algorithms | Graph Shortest Paths | Question 9
- Algorithms | Graph Shortest Paths | Question 10
- Algorithms | Graph Shortest Paths | Question 12
- Algorithms | Graph Shortest Paths | Question 13
- Algorithms | Graph Shortest Paths | Question 14
- Algorithms | Graph Shortest Paths | Question 15
- Johnson’s algorithm for All-pairs shortest paths | Implementation
- Number of paths from source to destination in a directed acyclic graph
- Shortest path in a directed graph by Dijkstra’s algorithm
- Building an undirected graph and finding shortest path using Dictionaries in Python
- Shortest path in a complement graph
- Create a Graph by connecting divisors from N to M and find shortest path
- Algorithms | Graph Traversals | Question 1
