LOADING... 0%

"Good is not perfect."

Tim Knobben

I'm

TSP Algorithm

This is a brute force algorithm to solve the TSP (Travelling Salesman Problem). Imagine a salesman that wants to sell his products in multiple cities in a country. He needs to go to all big cities. In order to do that he wants to know the route to travel to all cities the fastest way. Because time is money.

Feel free to try it out! Select points by clicking on them. Deselect points by clicking on them again!

Progress bar

0%

Total length: 0 pixels

Fastest path: [ ]

Found: 0 possible solutions

1x1

1x2

1x3

1x4

1x5

2x1

3x1

4x1

5x1

Get in contact with me!

Do you have a project for me? Do you want to let me know how awesome this website is? If you have any questions I can help you with, you can fill in the contact form and I'll respond as soon as possible!