Floyd-Warshall Algorithm

All-pairs shortest path algorithm used in graph theory.

Floyd-Warshall Algorithm Floyd's algorithm

The Floyd-Warshall algorithm is an all-pairs shortest path algorithm used in graph theory to find the shortest distances between every pair of vertices in a weighted graph. It operates by iteratively updating paths through intermediate nodes, making it particularly effective for dense graphs and those containing negative edge weights (but not negative cycles).

The Floyd-Warshall algorithm is named after Robert Floyd and Stephen Warshall, who independently discovered it.

shortest path algorithm

graph theory computer science

algorithm computational method graph theory