search

anvaka / ngraph.path

Path finding in a graph
https://anvaka.github.io/ngraph.path.demo/
MIT License
3.04k stars 186 forks source link

contraction hierarchies #15

Open edwintorok opened 4 years ago

edwintorok commented 4 years ago

You mention in your README that you want to know about faster algorithms. The fastest I heard of for OpenStreetmap data is http://project-osrm.org/ Paper describing the concept: http://algo2.iti.kit.edu/documents/chbasedtnr_TR.pdf

anvaka commented 4 years ago

Thank you for sharing!