Fastest golang Dijkstra path finder
-
Updated
May 3, 2024 - Go
Fastest golang Dijkstra path finder
Contraction Hierarchies (with bidirectional version of Dijkstra's algorithm) technique for computing shortest path in graph.
Convert OSM-file to graph for contraction hierarchies
Finding paths of interest in networks
Dijkstra, Bellman-Ford shortest path algorithms
Connecting nodes
Shortest path calculator using a bipartite to unipartite transformation and the Breadth First Search algorithm and exhaustive search algorithm
Add a description, image, and links to the shortest-paths topic page so that developers can more easily learn about it.
To associate your repository with the shortest-paths topic, visit your repo's landing page and select "manage topics."