Solving the Traveling Salesman Problem Algorithm (Free Source Code)

The Traveling Salesman Problem is a well-known challenge in Computer Science: It consists of finding the shortest route possible that traverses all cities on a given map only once.

The difficulty to solve it increases rapidly with the number of cities, and we do not know in fact a general solution that solves the problem.

In Tribby3d we use a form of shortest-path algorithm in the software. Can you guess which one, and how we are using it?

Credit: Diego Vicente.