JMU
Data Structures for Routing
An Introduction


Prof. David Bernstein
James Madison University

Computer Science Department
bernstdh@jmu.edu


Review
Worst Case Time for Dijkstra's Algorithm
Updating Labels
Finding the Smallest Temporary Label
Finding the Smallest Temporary Label (cont.)
Finding the Smallest Temporary Label (cont.)