Go language implementation: Dijkstra, Floyd, Yen's k-shortest paths Algorithm, R2T‑DSDN routing algorithm
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
- routing algorithm of the paper "R2T‑DSDN reliable real‑time distributed controller‑based SDN"
![](https://img2020.cnblogs.com/blog/821384/202112/821384-20211209172733209-684649359.png)