Hello! I'm digging into the internals of OSRM. The Processing Flow wiki page is quite informative, here are few additional questions. I can edit the wiki with the answers.
About the routing algorithm: when inspecting RoutingStep, there are forward and backward heap, so it looks like bidirectional Dijkstra, but the documentation states that the algorithm is based on contraction hierarchies. What's the trick? In the code, we see that some nodes are "core nodes". What does that mean? Thanks for your help! Francis -- Francis Giraldeau
_______________________________________________ OSRM-talk mailing list OSRM-talk@openstreetmap.org https://lists.openstreetmap.org/listinfo/osrm-talk
