新建文本文档.txt

TSP算法

	cout<<"*******************************************************************************"<<endl;
	cout<<"               优化的环游路线为：";

	//FILE* fp;
	//fp=fopen("d:\\rlt.txt","a");
//	char rlt[16];
	for(i=0;i<CityNum;i++)
	{
		if(i%8==0)
			cout<<endl;
		//	fprintf(fp,cityname[bestway[i]]);
		//	fprintf(fp,"<--->");
		
		//fprintf(fp,"%d%s",bestway[i]," ");
		cout<<cityname[bestway[i]]<<"<-->";
	}
	cout<<cityname[bestway[0]];
	
	//int citynum=0;
	//citynum=bestway[0]];


	//fprintf(fp,"");
	//fprintf(fp,cityname[bestway[0]]);
	//fprintf(fp,"\n");
	//fclose(fp);
	cout<<endl;
	cout<<"               环游路线的长度为："<<bestcost<<endl;
	cout<<"*******************************************************************************"<<endl;
	cout<<"EOF!"<<endl;