I’ve taken a chart, parsed every latitude‑longitude pair into a node list, then treated the old routes as weighted edges. Running Dijkstra or A* on that graph gives you a shortest‑flight path that still respects the classic navigation constraints. Then overlay the result on a modern map tile layer so you get a flight‑planning UI that looks contemporary but is built on the same data the mariners used.