https://github.com/hingston/checktsp

A brute force checker for the travelling salesman problem in Python
https://github.com/hingston/checktsp

travelling-salesman-problem

Last synced: 8 months ago
JSON representation

A brute force checker for the travelling salesman problem in Python

• Host: GitHub
• URL: https://github.com/hingston/checktsp
• Owner: hingston
• License: mit
• Created: 2018-04-27T03:54:14.000Z (over 7 years ago)
• Default Branch: master
• Last Pushed: 2018-09-13T12:38:07.000Z (about 7 years ago)
• Last Synced: 2025-01-06T15:49:28.690Z (9 months ago)
• Topics: travelling-salesman-problem
• Language: Python
• Size: 7.81 KB
• Stars: 1
• Watchers: 1
• Forks: 2
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

          
# CheckTSP

A brute force checker for the travelling salesman problem in Python

###### Usage

`python CheckTSP.py MAP_FILE_NAME`

###### Example

`python CheckTSP.py sample.txt`

`55`

## CreateTSPMap

###### Usage

`python createmap.py NUMBER_OF_TOWNS MAX_DISTANCE OUTPUT_FILE_NAME`

###### Output File Format

The first line is the number of lines (places to visit) and the following lines must have n + 1 numbers separated by spaces (distance between places). [See sample.txt](https://github.com/hingston/CheckTSP/blob/master/sample.txt) as an example.

## Authors

* Clint Gamlin - Original Python 2 version

* William Hingston - Python 3 and improvements