🧮 Floyd-Warshall

How It Works

Floyd-Warshall tries every node k as an intermediate pivot. For each pair (i, j), it checks whether going through k improves the current best distance.

• The matrix shows the complete all-pairs state after every check.
• The graph highlights the current pair i → j, the pivot k, and any improved shortest path.
• If a shorter route is found, the corresponding matrix cell flashes green and the path display updates immediately.