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 the Floyd-Warshall algorithm. For more information on the all-pairs shortest-paths problem and its solution use the Floyd-Warshall algorithm.

Refer: Dynamic Programming | Set 16 (Floyd Warshall Algorithm) So, option (D) is correct.

Quiz of this Question
Please comment below if you find anything wrong in the above post

My Personal Notes arrow_drop_up

Save