Isn't the tavelling salesman supposed to return to the start city?
From "https://en.wikipedia.org/wiki/Travelling_salesman_problem"
Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city?
Isn't the tavelling salesman supposed to return to the start city?
From "https://en.wikipedia.org/wiki/Travelling_salesman_problem"