Some clarification:
* the process of the route finding is done by Dijkstra or A* or with a preprocessing (CH)
* valhalla does not use CH to my knowledge
* route optimization requires a completely different technique and valhalla does not do this
> "The OP (Mapzen's Valhalla) appears to have a similar approach as OSRM"
no :) ! OSRM is limited to CH (really fast) and valhalla is limited to Dijkstra/A* (really flexible).
For a public source, Dennis Luxen updated his Linkedin profile.
Thanks for adding your knowledge about the internals of Valhalla code.
Some clarification:
* the process of the route finding is done by Dijkstra or A* or with a preprocessing (CH)
* valhalla does not use CH to my knowledge
* route optimization requires a completely different technique and valhalla does not do this
> "The OP (Mapzen's Valhalla) appears to have a similar approach as OSRM"
no :) ! OSRM is limited to CH (really fast) and valhalla is limited to Dijkstra/A* (really flexible).