Introduction - If you have any usage issues, please Google them yourself
TSP (Traveling Saleman Problem, TSP) also translated as traveling salesman problem, referred to as TSP, is the most basic routing problem, the problem is the starting point in the search for single travelers departing through all the given demand points, and finally back to the origin of the minimum path costs. Using backtracking, neighbor method to achieve, a graphical interface.