Question

Based on your reading and understanding about Floyd-Warshall algorithm .

1. what is the purpose of the Floyd Warshall Alogorithm?

2. When it is useful?

Answer 1

Purpose of the Floyd Warshall Alogorithm

Floyd–Warshall algorithm is an algorithm for finding shortest paths in a weighted graph with positive or negative edge weights (but with no negative cycles). It does so by comparing all possible paths through the graph between each pair of vertices and that too with O(V3) comparisons in a graph.

.Floyd Warshall Algorithm. Floyd-Warshall algorithm is used to find all pair shortest path problem from a given weighted graph. As a result of this algorithm, it will generate a matrix, which will represent the minimum distance from any node to all other nodes in the graph.Floyd-Warshall Algorithm is an algorithm for finding the shortest path between all the pairs of vertices in a weighted graph. This algorithm works for both the directed and undirected weighted graphs. But, it does not work for the graphs with negative cycles (where the sum of the edges in a cycle is negative).The Floyd-Warshall algorithm takes into account all possible routes so that there are some routes are displayed while the greedy algorithm checks every node that is passed to select the shortest route (Local Optimum) so that the time needed in searching is faster.