search

LdDl / ch

Contraction Hierarchies (with bidirectional version of Dijkstra's algorithm) technique for computing shortest path in graph.
Apache License 2.0
47 stars 5 forks source link

[FEATURE REQUEST] Weak contraction hierarchies or other approaches to improve contraction process #25

Open LdDl opened 2 years ago

LdDl commented 2 years ago

Is your feature request related to a problem? Please describe. Consider extension of current implementation with customization

Describe the solution you'd like and provide pseudocode examples if you can Prepare new branch(-es) and do some testing stuff in it

Additional context Links to original papers:

  1. Weak contraction hierarchies https://i11www.iti.kit.edu/_media/teaching/theses/weak_ch_work-1.pdf
  2. Transit node routing https://arxiv.org/pdf/1302.5611.pdf
  3. Parallel Time-Dependent Contraction Hierarchies http://algo2.iti.kit.edu/download/vetter_sa.pdf