Status: IN
The codebase consistently favors algorithmic correctness and simplicity over performance optimality: search heuristics use admissible but loose bounds (haversine for road distance, global max speed for time estimates), guaranteeing optimal results at the cost of extra exploration, while data structure operations use brute-force approaches (linear prefix scan, key-by-key Merkle diff, full re-sort on insertion, linear cache purge), correct by simplicity at pedagogical scale.
Admissible-but-loose heuristics and brute-force-but-correct data structures both sacrifice performance for guaranteed correctness
Depends on (SL): routing-heuristics-prioritize-correctness-over-tightness, brute-force-acceptable-at-pedagogical-scale