It's a java program with GUI that solves the Travelling Salesman Problem using Simulated Annealing. Simulated Annealing is a machine learning algorithm used for optimization.
- First line contains number of nodes (n)
- Next n lines contain the coordinates of ith node separated by space (x y)
- Last line contains a fixed number 9999999999