to solve the all-pairs shortest paths problem which algorithm's is/are used
A. Floyd's algorithm
B. Dijkstra's single-source shortest paths
C. Prim's Algorithm
D. Kruskal's Algorithm
A)a and c
B)a and b
C)b and c
D)c and d

Question

Quizplus · Accepted Answer

Floyd's algorithm is specifically designed for solving the all-pairs shortest paths problem in a graph, and Dijkstra's algorithm can be adapted to solve the all-pairs shortest paths problem by running it once for each vertex as the source. Prim's and Kruskal's algorithms are used for finding minimum spanning trees, not for solving the all-pairs shortest paths problem.

To Solve the All-Pairs Shortest Paths Problem Which Algorithm's Is/are