Question: Consider a map (graph) where each edge has a nonnegative length. Say we want to find the shortest distance from one vertex to all the rest. (This is the problem we considered in Mon 29 Sep recitation.) How can you use priority queues to find this?
Hint: Think about the searching algorithm we used for Assignment 2.