Highly optimised implementation of the Dijkstra algorithm, used for find the shortest path between points of a graph.
Full documentation available on GoDoc.
Dijkstra shortest path problem solved in Go
Highly optimised implementation of the Dijkstra algorithm, used for find the shortest path between points of a graph.
Full documentation available on GoDoc.
Dijkstra shortest path problem solved in Go
MIT License