TSP Solution Space Network
Visualizing the network of tour solutions for the Traveling Salesman Problem.
Each node represents a unique tour (accounting for cyclic rotations and reversals),
and edges connect tours that differ by a single chunk reversal.
Network Node (Tour)
Edge (Chunk Reversal)
Optimal Tour
Connected Neighbor
Best Neighbor (Hill Climbing Target)
Solution Space Network Information:
Number of Cities:
3
4
5
6
7
Regenerate Cities
Toggle Labels