graph / TravelingSalesman / 0.1.1
The travelling salesman problem (TSP) asks the following question: Given a list of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city? It is an NP-hard problem in combinatorial optimization, important in operations research and theoretical computer science.