Which one of the following algorithm design techniques is used in finding all pairs of shortest distances in a graph?
(A) Dynamic programming
(B) Backtracking
(C) Greedy
(D) Divide and Conquer
Answer: (A)
Explanation: Floyd Warshall Algorithm is the All Pairs Shortest Path problem which uses Dynamic Programming to find shortest distances between every pair of vertices in a given edge weighted directed Graph.
Option (A) is correct.
Quiz of this Question
Article Tags :
Recommended Articles