tsp的java源码实现旅行商问题，即TSP问题（Traveling Salesman Problem）又译为旅行推销员问题、货郎担问题，是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路径的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。(The Java source of TSP is one of the famous problems in the field of mathematics, that is, the TSP problem (Traveling Salesman Problem), which is also translated as travel salesman problem and cargo carrier problem. Suppose a traveler wants to visit a n city. He has to choose the way he wants to go. The limit of the path is that each city can visit only once, and finally it will return to the original city. The goal of path selection is to obtain the minimum path of all paths.)