Dijkstra's Algorithm — Interactive Visualizer

Computes the absolute shortest paths sequentially from a source node to all other reachable nodes in a positively edge-weighted graph.