A couple of implementations of different shortest path algorithms. Mostly just a learning project for me but might be useful for others as well.

Please contribute if you find errors or have ideas for a better way of doing things.

So far I've only implemented Dijkstra's algorithm but I plan to also do Bellman-Ford and maybe A*.

$ go get github.com/flemeur/go-shortestpath/dijkstra