开始
Y
N
!arrived[j]&&w[p][j]min
in
nc[s+1]=i;arrived[i]=1
s=s+1;cost=c[nc[s]][i]
cost=cost+w[p][1]; return cost
k = j;\t\t\t\tmin = w[p][j];
将文件内容转化成邻接矩阵并保存到二维数组w中
i++
!arrived[i]==1&&bestcostcost+c[nc[s]][i]
min=w[p][j]} cost=cost+w[p][k]; path[i]=k; arrived[k]=true; p=k;
bestcostcost+c[nc[s]][0]
读取tsp.txt文件
arrived[i]=0; nc[s+1]=0;
i=n
结束
s==n-1
path[i]=nc[i] bestcost=cost+c[nc[s]][0];
将文件内容转化成邻接矩阵并保存到二维数组c中
