Project to learn Go as well as to experiment with Dijkstras shortest path algorithm.
-
Updated
Oct 9, 2022 - Go
Project to learn Go as well as to experiment with Dijkstras shortest path algorithm.
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
Connecting nodes
Dijkstra, Bellman-Ford shortest path algorithms
A collection of shortest path algorithms written in Go
Route finder in a multigraph for the city of Porto with A*,ALT and Genetic Algorithm implementations
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 shortest-path-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the shortest-path-algorithm topic, visit your repo's landing page and select "manage topics."