https://github.com/KeepTheBeats/routing-algorithms

Go language implementation:

- shortest paths through dfs - shortest paths through Dijkstra - use Disjoint Set to check whether a network is connected - shortest paths through Floyd - k-shortest paths through Yen's Algorithm and dfs, dfs can make test cases for Yen's Algorithm.