Practice 3

I checked solution descriptions and solutions in for the problems in practice 3.

• Bumped
• Running Routes
• Zipline
• Stop Counting
• Suspension Bridges

Additional resources

• Sedgwick's Lecture Slides on Dijkstra. See slide 37 for a more precise complexity analysis than I gave in class. We're generally using the "lazy" binary heap variant (Python: heapq, Java: PriorityQueue, C++: priority_queue) with O(E log V) or O(m log n).