$./dijkstra
graph:
source:
1.5 step/s
# algorithm
1Dijkstra(G, s)
2begin
3 dist[s] ← 0; ∀v≠s: dist[v] ← ∞
4 Q ← V // priority queue
5 while Q ≠ ∅ do
6 u ← extractMin(Q)
7 for each v ∈ adj(u) do
8 if dist[u]+w(u,v) < dist[v]
9 dist[v] ← dist[u]+w(u,v)
10 prev[v] ← u
11end
# weighted graph
42153216ABCDEF
current relaxing visited distance
# distances from source
nodedistancepreviousstatus
A——○
B——○
C——○
D——○
E——○
F——○
# current action
select a source node and click "run" to begin...