combinatorial designs graph algorithms
No Two Walked Together Twice
A shortest or cheapest route can look diversified because it has many hops while repeatedly relying on one untested pairing. Combinatorial designs supply the coverage constraint that graph optimization does not.