GATE Exam | Aptitude Questions | GATE Syllabus | GATE Result | Mock Test | GATE Preparation
0 votes

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

asked in Graph search, minimum spanning trees, shortest paths by gate

1 Answer

0 votes

Topological Sort

answered by gate

Related questions

The best answer to any question