Track 16 · Lesson 12 of 12

Choosing an approach: a delivery planner

Weigh readability, speed and memory when choosing an algorithm, use heapq for top-k and priority queues, and build a route and schedule planner milestone by milestone.

You will be able to

• Compare candidate solutions by correctness, clarity, time and memory, and pick one deliberately
• Use heapq for top-k queries and as a priority queue
• Find the fastest route in a weighted graph with Dijkstra's algorithm
• Combine parsing, graph search, greedy scheduling and heuristics into a small working planner