Travelling Salesman Command (TSP)
- Author:
- Ivan De Winne
Travelling Salesman Problem (TSP)
Given a list of cities and the euclidean distances between each pair of cities,
what is the shortest possible route that visits each city exactly once and returns to the origin city?
Command Travellingsalesman()
Returns the shortest closed path which goes through each point exactly once.
Drag the points