[DennisL123]

I was referring to variants of Customizable Route Planning. Easiest to implement is likely the partitioner of Sommer et al, and a unidirectional multi-level dijkstra.

[n4r9]

Ah, I guess you mean this paper then: https://www.microsoft.com/en-us/research/wp-content/uploads/...

There are many similarities between this approach and customisable contraction hierarchies. The latter allows a particularly elegant query-time algorithm involving only a couple of linear sweeps, I suspect even in the many-many scenario.

[DennisL123]

Yep, that’s the one. There are a number of follow-up papers that engineer individual aspects of the implementation.