Explore modules

Floyd-Warshall Algorithm

Visualize the dynamic programming approach to finding shortest paths between all pairs of vertices in a weighted graph.

Free theory article

Visualize the dynamic programming approach to finding shortest paths between all pairs of vertices in a weighted graph.

Concept & interpretation

The Floyd-Warshall algorithm is a dynamic programming approach to finding the shortest paths between all pairs of vertices in a weighted graph. Unlike Dijkstra's algorithm which finds shortest paths from a single source, Floyd-Warshall computes the optimal paths for every possible pair simultaneously. It elegantly handles graphs with positive or negative edge weights (though not negative cycles) and operates in O(V3) time complexity.

Read the full free theory article