Question

Which of the following algorithms solves the all-pair shortest path problem ?

• A. Dijkstra's algorithm
• B. Floyd's algorithm
• C. Prime's algorithm
• D. Warshall's algorithm

Answer 1

The correct option is B Floyd's algorithm

Floydwarshall algorithm is for solving the all pairs shortest path problem. The problem is to find shortest distances between every pair of vertices in a given edge weighted directed graph with positive or negative edge weights.

It does so by incrementally improving an estimate on the shortest path between two vertices, until the estimate is optimal.