Contraction Hierarchies (with bidirectional version of Dijkstra's algorithm) technique for computing shortest path in graph.
Last push 1 month ago
breadth-first-search
contraction-hierarchies
dijkstra
dijkstra-algorithm
graph
hacktoberfest
hacktoberfest-accepted
hactoberfest2022
isochrone-map
isochrones
osm
pathfinding
shortest-path-algorithm
shortest-paths
turn-restrictions
Created
May 2019
Total stars
55
Last 7 days
0
Last 30 days
0
Last 12 months
+3
README badge
[](https://bestofgo.dev/LdDl/ch)