go-enum-algorithm
implement an enumeration algorithm in GO
run the code
go run main.go
// should print out each route and its total distance
[[0 14 15 17 16] [14 0 24 8 36] [15 24 0 34 4] [17 8 34 0 30] [16 36 4 30 0]]
[2 0 1 3 4] 67
[2 0 1 4 3] 95
[2 0 3 1 4] 76
[2 0 3 4 1] 98
[2 0 4 1 3] 75
[2 0 4 3 1] 69
[2 1 0 3 4] 85
[2 1 0 4 3] 84
[2 1 3 0 4] 65
[2 1 3 4 0] 78
[2 1 4 0 3] 93
[2 1 4 3 0] 107
[2 3 0 1 4] 101
[2 3 0 4 1] 103
[2 3 1 0 4] 72
[2 3 1 4 0] 94
[2 3 4 0 1] 94
[2 3 4 1 0] 114
[2 4 0 1 3] 42
[2 4 0 3 1] 45
[2 4 1 0 3] 71
[2 4 1 3 0] 65
[2 4 3 0 1] 65
[2 4 3 1 0] 56
