Routing Faster Than Dijkstra Thanks to Contraction Hierarchies — Part 2

When looking for faster routing algorithms, it is tempting to focus on the search itself. In Part 1, we explained how we could try to…