Algorithms | Graph Shortest Paths | Question 10

Last Updated :
Discuss
Comments

Which of the following algorithm can be used to efficiently calculate single source shortest paths in a Directed Acyclic Graph?

Dijkstra
Bellman-Ford
Topological Sort
Strongly Connected Component

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