文件名称:TSP
介绍说明－－下载内容均来自于网络，请自行研究使用
v3，…，v6 各一次且仅一次，最后返回v1。D
为各城市间的距离矩阵。
问：该推销员应如何选择路线，才能使总的行程最短？-V3,... V6, the once and only once, and finally return to v1. D
As the distance matrix between cities.
Q: the salesman should be how to choose the route, in order to make the total journey is the shortest?
为各城市间的距离矩阵。
问：该推销员应如何选择路线，才能使总的行程最短？-V3,... V6, the once and only once, and finally return to v1. D
As the distance matrix between cities.
Q: the salesman should be how to choose the route, in order to make the total journey is the shortest?
(系统自动生成,下载前可以参看下载内容)
下载文件列表
TSP.cpp