Simple library to solve instances of Symmetric Travelling Salesman Problem.
Copy src and tests folders to your project.
>>> from src import Solver
>>> s = Solver(algorithm='dynamic')
>>> shortest_tour = s.solve(path='a4_.tsp')
>>> shortest_tour
[0, 1, 3, 2]The description of supported file format can be found here.
Exact algorithms
Approximation algorithms
Tests are implemented using pytest. To run all tests, please refer to this piece of pytest documentation.
- Aleksei Tcysin
- Malshani Ranchagoda
- Sivasundar Karthikeyan