← Fly-in live demo

Learning notes

Fly-in needed algorithms I had not written before. These are the interactive pages I learned them from, in the order I built the project. Most of them run step by step on the project's own maps and on my code as it was at that stage.

Claude (Anthropic) made these pages to teach me; I wrote the solver logic myself. They explain ideas and give skeletons, not finished solutions. The code shown is from the stage when each page was made, so it can differ from the final version.

Fly-in, explained

Five short pages, read before writing any code: what the parts are and how they fit.

• 1The big pictureThe pipeline from map file to output, and why static map data and moving drones stay apart.
• 2The modelsZone, Connection, ZoneType and Network: one line of the map file becomes one object.
• 3The graphA graph without a library: two dictionaries and an adjacency list.
• 4Time and bookingsWhy a shortest path is not enough, and the booking calendar that fixes it.
• 5Movement rulesRestricted zones, freed space, link capacity, each as a tiny calendar.

Step-through visuals

Interactive pages with Step, Back and Auto-play, made while building each part.

• pathfindingBFS vs DFSTwo ways to explore a graph, run side by side: why breadth-first finds the shortest route.
• pathfindingThe pathfinder, step by stepMy BFS on real maps: the queue, came_from and the rebuilt route, line by line.
• schedulingheapq vs a plain queueWhy restricted zones need a priority queue that always takes the earliest turn first.
• schedulingBuilding the schedulerFrom BFS to a search over places and turns, with waiting and capacity checks.
• schedulingThe booking calendarReal routes booked one step at a time into the zone and corridor calendars.