Dijkstra's algorithm on a six-node weighted graph.

Weighted graph · Dijkstra frontier active settled
Priority queue (min on top)
empty
Distance from source
Step 0 / 0

Press Play. Dijkstra seeds the priority queue with the source at distance 0.

Start Speed
settled
0
relaxations
0
heap size
0
progress
0%
timeline0 / 0
←→space walk steps