文件名称:TravelerTSP
介绍说明－－下载内容均来自于网络，请自行研究使用
旅行商问题(TSP问题)就是一销售商从n个城市中的某一城市出发，不重复地走完其余n-1个城市并回到原出发点，在所有可能的路径中求出路径长度最短的一条。
本题假定该旅行商从第1个城市出发。-Traveling salesman problem (TSP problem) is a vendor from the n cities, starting in a city, do not finish the rest of repeated n-1 cities and return to the original starting point, calculate all possible paths in the shortest path length one. This question assumes that the traveling salesman starting from a city.
本题假定该旅行商从第1个城市出发。-Traveling salesman problem (TSP problem) is a vendor from the n cities, starting in a city, do not finish the rest of repeated n-1 cities and return to the original starting point, calculate all possible paths in the shortest path length one. This question assumes that the traveling salesman starting from a city.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
TravelerTSP.cpp