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!
Total length: 0 pixels
Fastest path: [ ]
Found: 0 possible solutions