Section Recap

You have learned Floyd-Warshall, the $O(n^3)$ algorithm for all-pairs shortest paths. You understand the DP formulation, loop order ($k$, $i$, $j$), negative cycle detection, and path reconstruction. You have solved CSES and LeetCode problems.

Floyd-Warshall is your tool for all-pairs queries, small graphs, and negative edges. You can now recognize when to use it and implement it correctly. Next section: more advanced shortest path techniques.