← Project history & credits
Browser adaptation · 2026
Shortest paths
Trace Dijkstra from one node, or watch Floyd–Warshall build every shortest distance.
Loading interactive controls…
How to explore
Edit positive edge weights, choose a source, and step through the search. Dijkstra settles one node at a time. Floyd–Warshall allows each node as an intermediate and updates the distance matrix.
About this version
An undirected, connected graph with positive integer weights. Dijkstra’s source-to-target route and Floyd’s all-pairs matrix describe the same graph.
Browser visualizations extending the Dijkstra and Floyd work in the collaborative 2017 Python/Tkinter archive. Original project: Andrés Brenes, Axel Fernández, and Iván López.