This is a Java implementation of Christofides algorithm for solving the Travelling Salesman Problem.
The points for the instance to be solved should be stored in a text or csv file in the data folder. The file should be structured as follows:
x1,y1
x2,y2
...