Shortest Paths

Dijkstra's Algorithm

1. Create a new Priority Queue
2. Insert the root node
3. Move through minimum in PQ until empty
4. Add to PQ for each unvisited destination

More information about Dijkstra's Algorithm