github.com/LdDl/ch (go): Contraction Hierarchies (with bidirectional version of Dijkstra's algorithm) technique for computing shortest path in graph.
Keywords: 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