Description
Add a module for generating random Traveling Salesman Problem (TSP) instances. The goal is to provide flexible, reproducible datasets that can be used to benchmark quantum optimisation algorithms under varying levels of problem difficulty. The difficulty may be controlled by cluster spread, intra-/inter-cluster distance ratio.