MovHex is my final project for Algorithms and Principles of Computer Science at Politecnico di Milano. It focuses on a dynamic hex-grid routing problem with mutable costs, directed air routes, shortest-path queries, and strict performance constraints.
The full technical write-up lives in the linked blog post, where I go into the specification, the geometric model, the data layout, the Dijkstra variants, and the profiling work that shaped the final implementation.