UGC-NET | UGC NET CS 2015 Jun – III | Question 31

An all-pairs shortest-paths problem is efficiently solved using:
(A) Dijkstra’ algorithm
(B) Bellman-Ford algorithm
(C) Kruskal algorithm
(D) Floyd-Warshall algorithm


Answer: (D)

Explanation: An all-pairs shortest-paths problem is efficiently solved using Floyd-Warshall algorithm.
For more information on all-pairs shortest-paths problem and its solution using Floyd-Warshall algorithm Refer:Dynamic Programming | Set 16 (Floyd Warshall Algorithm)
So, option (D) is correct.

Quiz of this Question

My Personal Notes arrow_drop_up
Article Tags :

Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.