Floyd Warshall
In plain terms
Computes shortest paths between all pairs of nodes.
Going deeper
Floyd-Warshall finds the shortest distance between every pair of nodes via dynamic programming over intermediate vertices. It's simple but cubic in time.
Under the hood
O(V³) time and O(V²) space; handles negative edges (no negative cycles) and is great for small dense graphs.
Examples
All-pairs shortest paths, transitive closure, small dense networks.
Think of it like...
Like building a complete mileage chart between every pair of cities at once.