Traveling Salesman Problem
Find the Shortest Route Through All Cities
About This Method
The Traveling Salesman Problem (TSP) finds the shortest possible route that visits each city exactly once and returns to the starting city. This solver uses exhaustive enumeration to guarantee the optimal solution.
💡 Tip: Supports decimal distances. Use - or ∞ for no direct
path between cities.