Floyd-Warshall All-Pairs Shortest Paths

Robert Floyd, 1962

Published by Robert Floyd in 1962, the Floyd-Warshall algorithm finds shortest paths between every pair of vertices in a weighted directed graph. It works by systematically considering whether a path through an intermediate node k improves the shortest known distance between nodes i and j. The visualization displays the N×N distance matrix updating cell by cell, with the current intermediate node k highlighted in the graph, the active cell in gold, and updated cells flashing coral before settling to teal.