Contraction Hierarchies (with bidirectional version of Dijkstra's algorithm) technique for computing shortest path in graph.
graph
osm
pathfinding
dijkstra
isochrones
shortest-paths
breadth-first-search
hacktoberfest
dijkstra-algorithm
shortest-path-algorithm
isochrone-map
contraction-hierarchies
turn-restrictions
hacktoberfest-accepted
hactoberfest2022
-
Updated
Dec 7, 2023 - Go