Connecting nodes

Project to learn Go as well as to experiment with Dijkstras shortest path algorithm.

simple shortest path route finder, turn-by-turn navigations, ETA, map matching, and TSP on Openstreetmap using Contraction Hierarchies + Bidirectional Dijkstra/A* algorithm, Uber H3, Hidden Markov Model, Simulated Annealing, and Pebble DB

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.