A visual study of Floyd-Warshall algorithm
Place trees or move them with the mouse. Edges are created if their distances are less than 100px.
This algorithm calculates the shortest path for all pairs on the entire graph.
Click on a tree to select it, then hover over another tree to see the shortest path from the selected tree to the hovered tree.