Travelling Salesman Problem

Generate cities and compare a fast Nearest Neighbor heuristic with an exact Brute Force search.

Ready.

Nearest Neighbor

At each step, the current city moves to the nearest unvisited city. It is fast, but it does not guarantee the optimal tour.

Brute Force

Checks every possible tour while fixing one city as the starting point. It finds the optimum, but its factorial growth makes it practical only for small inputs.