Travelling Salesman

Travelling Salesman

Travelling Salesman is a very famous coding problem with a very simple concept: A salesman needs to visit several cities, returning to the point of origin at the end of the journey.

There are several possible solutions, each with its pros and cons. I chose the Nearest Neighbor solution, which uses the distance between cities as a parameter to define the next destinations.

This project implements the solution visually, using Unity Engine

Source Code

The source code can be found on Github: https://github.com/felipegodoyf/travelling-salesman