Algorithms | Graph Shortest Paths | Question 10
Which of the following algorithm can be used to efficiently calculate single source shortest paths in a Directed Acyclic Graph?
(A) Dijkstra
(B) Bellman-Ford
(C) Topological Sort
(D) Strongly Connected Component
Answer: (C)
Explanation: Using Topological Sort, we can find single source shortest paths in O(V+E) time which is the most efficient algorithm. See following for details.
Shortest Path in Directed Acyclic Graph
Quiz of this Question
Last Updated :
28 Jun, 2021
Like Article
Save Article
Share your thoughts in the comments
Please Login to comment...