Christofieds algorithm implementation for Travelling Salesman problem. Implemented from here https://en.wikipedia.org/wiki/Christofides_algorithm Currently uses NetworkX for Blossom algorithm and some other routines and graph_algos for other algorithms.
The complexity is O(V^3)
The approximation ratio is 1.5 at most
-
pip3 networkx (matplotlib) if need drawing
-
Needs graph_algos git project (or symbolic link) cloned into source directory.