An all-pairs shortest-paths problem is efficiently solved using :
UGC NET 2015
An all-pairs shortest-paths problem is efficiently solved using :
- A.
Dijkstra's algorithm
- B.
Bellman-Ford algorithm
- C.
Kruskal algorithm
- D.
Floyd-Warshall algorithm
Attempted by 787 students.
Sign up free to check your answer
Sign up freeLoading lesson…

