Dijkstra's Shortest Path
425108122634
A 0
B ∞
C ∞
D ∞
E ∞
F ∞
G ∞
Find the cheapest route from A to everywhere. Every node starts at ∞ — unreachable as far as we know — except A, which costs 0 to reach from itself.
step 01/28
- just discovered
- visited
- found it
- visiting now