Dijkstra's Algorithm
Dijkstra's Algorithm in Action
= home sweet home
= processed
= being processed
= has been updated
= has not yet been updated
= optimal paths
= direct links
n =
100
200
300
400
500
Radius =
1
2
3
4
5
Delay =
0
10
50
100
200
300
400
500
1000
2000
(Click the Solve button to solve the new grid)
Brought to you by
Moshe's Place
Since 1995