-
### What is the expected enhancement?
In order to perform shortest path searches on massive graphs, it would be quite useful to have some implementation of contraction hierarchies. https://en.wikiped…
-
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.ki…
-
Implement contraction hierarchies algorithm
-
Hi, I was wondering from a lot of time, I can't get, if the contraction hierarchies is completely safe, just to know, that method alters the actual nodes? or it keeps all the graph nodes?
latot updated
11 months ago
-
For very large areas, when is it worth it to use https://github.com/easbar/fast_paths/? Should the graph files store the CH (more to download and deserialize) or build the CH at startup?
-
The Experimental Query methods detailed here
https://github.com/RoutingKit/RoutingKit/blob/master/doc/ContractionHierarchy.md
have no implementations for customizable contraction hierarchies.
We…
-
It currently uses contraction hierarchies. A bulk routing with dijkstra should be considerably faster.
-
http://147.32.87.157:8084/map?latFrom=50.4104169&lonFrom=14.9354403&latTo=50.4096717&lonTo=14.9358481&priority=TIME&algorithm=CONTRACTION_HIERARCHIES&route=true
http://147.32.87.157:8084/map?latFrom=5…
-
I don't believe there is currently a way to save pandana networks in their pre-computed state, i.e. being able to load a saved pandana network without re-running contraction hierarchies. Is this corre…
-
⚠ Have you searched for similar, already existing issues?
I have but this is hard to search for.
**Is your feature request related to a problem? Please describe.**
A clear and concise descripti…
Atemu updated
2 months ago