Skip to content

Latest commit

 

History

History
7 lines (5 loc) · 314 Bytes

README.md

File metadata and controls

7 lines (5 loc) · 314 Bytes

Traveling-Salesman-Problem

A simple heuristic construction for solving the traveling salesman problem (TSP) in Python. It also gives a comparison with an approximation algorithm.

Demo

demo image of algorithm

I did it thanks to NeuralNine's video.