pytsp 0.2.7

Few algorithms for TSP problem in Python

=====
pytsp
=====


.. image:: https://img.shields.io/pypi/v/pytsp.svg
:target: https://pypi.python.org/pypi/pytsp

.. image:: https://img.shields.io/travis/BraveDistribution/pytsp.svg
:target: https://travis-ci.org/BraveDistribution/pytsp

.. image:: https://readthedocs.org/projects/pytsp/badge/?version=latest
:target: https://pytsp.readthedocs.io/en/latest/?badge=latest
:alt: Documentation Status




Few algorithms for TSP problem in Python


* Free software: MIT license
* Documentation: https://pytsp.readthedocs.io.

Notice
--------
This package is under heavy development. The code may not be efficient and may potentially lead to bugs.

Features
--------

* Christofides algorithm
* Minimal spanning tree (Prim algorithm)
* 2-opt algorithm
* 3-opt algorithm
* Permutations
* Nearest Neighbor
* Simulated Annealing (SA)

Contributions
-------
* Feel free to contribute any way possible for you (Implement new algorithms or tests)
* Feel free to ask for new algorithms via "Issues" tab.
Credits
-------

This package was created with Cookiecutter_ and the `audreyr/cookiecutter-pypackage`_ project template.

.. _Cookiecutter: https://github.com/audreyr/cookiecutter
.. _`audreyr/cookiecutter-pypackage`: https://github.com/audreyr/cookiecutter-pypackage


=======
History
=======

0.1.0 (2018-10-20)
------------------

* First release on PyPI.