routing-algorithms

Go version: 1.17.3

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"

generate random numbers that follow Poisson distribution
generate random numbers that follow Normal distribution through rejection sampling
generate random numbers that follow Normal distribution through Box-Muller

Name		Name	Last commit message	Last commit date
Latest commit History 35 Commits
.vscode		.vscode
experiments/r2t-dsdn-config		experiments/r2t-dsdn-config
mymath		mymath
network		network
random		random
.gitignore		.gitignore
README.md		README.md
execute.sh		execute.sh
go.mod		go.mod
go.sum		go.sum
gotest.sh		gotest.sh
main.go		main.go