Orbital Delivery Router: Nearest-Neighbor & 2-opt TSP (2D)

This 2D companion turns the 3D training arena's "logistics" delivery agent into a readable routing problem: a courier drone must visit every depot scattered across the orbital lanes exactly once and return to the hub, and the order it flies is computed by a real travelling-salesman heuristic — a greedy nearest-neighbor construction refined by 2-opt edge swaps — with debris fields adding a genuine cost penalty to any leg that passes too close, so the route you watch is the actual output of the algorithm, not a scripted path.