simple shortest path route finder, turn-by-turn navigations, ETA, and map matching on openstreetmap using Contraction Hierarchies + Bidirectional Dijkstra/A* algorithm, Uber H3, Pebble DB, and zstd
-
Updated
Jul 30, 2024 - Go
simple shortest path route finder, turn-by-turn navigations, ETA, and map matching on openstreetmap using Contraction Hierarchies + Bidirectional Dijkstra/A* algorithm, Uber H3, Pebble DB, and zstd
Convert OSM-file to graph for contraction hierarchies
Contraction Hierarchies (with bidirectional version of Dijkstra's algorithm) technique for computing shortest path in graph.
Add a description, image, and links to the contraction-hierarchies topic page so that developers can more easily learn about it.
To associate your repository with the contraction-hierarchies topic, visit your repo's landing page and select "manage topics."