To clone the repo and its dependencies (submodules):
git clone --recursive https://github.com/dilsonpereira/christofides-algorithm
Compilation on Linux:
make christofides
Usage:
./christofides -f <inputFile> [--coord] [-p] [-g <outputFile>]
Option -f is used to specify the file name.
The input file will be assumed to be in a TSPLIB format unless option --coord is provided. In that case, the first line of the file should give the number of vertices n followed by n lines giving the X and Y coordinates of the corresponding vertices.
Option -p will print the edges in the solution.
Option -g will output the solution in Graphviz neato format to outpuFile. If you have Graphviz installed and instance coordinates are available, you can generate an image of the solution by running
neato -Tps <christofidesOutputFile> > <image.eps>
This code also provides a module for parsing TSPLIB instances, a module for solving minimum spanning tree problems and a module for solving minimum cost perfect matching problems.
See Example.cpp to learn how to use the library.
Feel free to contact me if you have any problem.