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?
(C) Topological Sort
(D) Strongly Connected Component
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.