Which one of the following algorithm design techniques is used in finding all pairs of shortest distances in a graph?
(A) Dynamic programming
(D) Divide and Conquer
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
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.