Dijkstra using a Graph Look at neighbors Start of A and calculate - - PDF document

electronic visualization laboratory, university of illinois at chicago

Dijkstra using a Graph

A/0 B/1 E/∞ D/2 C/5 F/∞ 1 2 4 1 1 3 5 Start Dest Look at neighbors

• f A and calculate

their distances Nodes under consideration

electronic visualization laboratory, university of illinois at chicago

A/0 B/1 E/5 D/2 C/5 F/∞ 1 2 4 1 1 3 5 Start Dest Of the nodes under consideration, look at node with smallest distance and calc distance to neighbors Nodes under consideration Nodes visited

electronic visualization laboratory, university of illinois at chicago

A/0 B/1 E/5 E/3 D/2 C/5 F/5 1 2 4 1 1 3 5 Start Dest Of the nodes under consideration, look at node with smallest distance and calc distance to neighbors Nodes under consideration Nodes visited Save the smaller distance

electronic visualization laboratory, university of illinois at chicago

A/0 B/1 E/3 D/2 C/5 F/5 F/4 1 2 4 1 1 3 5 Start Dest Of the nodes under consideration, look at node with smallest distance and calc distance to neighbors Nodes under consideration Nodes visited

electronic visualization laboratory, university of illinois at chicago

A/0 B/1 E/3 D/2 C/5 F/4 1 2 4 1 1 3 5 Start Dest Nodes under consideration Nodes visited C has no unvisited neighbors so stop All this time remember to store the path info in each node as we visited each node