traveling.h

研究生算法作业著名的旅行者问题

// Traveling.h: interface for the CTraveling class.
//
//////////////////////////////////////////////////////////////////////

#if !defined(AFX_TRAVELING_H__D8AE81E7_BB48_4A6E_ACD6_4A6368429B12__INCLUDED_)
#define AFX_TRAVELING_H__D8AE81E7_BB48_4A6E_ACD6_4A6368429B12__INCLUDED_

#if _MSC_VER > 1000
#pragma once
#endif // _MSC_VER > 1000

#define NoEdge -1

//##ModelId=40863F41026D
class CTraveling  
{
public:
	//##ModelId=40863F410288
	CTraveling();
	//##ModelId=40863F410292
	virtual ~CTraveling();

	//##ModelId=40863F41029C
	void SetCityCount(const int p);				//设置城市数目
	//##ModelId=40863F4102B0
	int GetCityCount()const { return n;}		//获得城市数目
	
	//##ModelId=40863F4102BB
	int TSP(int **a,int v[],int n); 
	
private:
	//##ModelId=40863F4102E2
	void Swap(int &a,int &b);
	//##ModelId=40863F410300
	void Backtrack(int i);
	//##ModelId=40863F410315
	int n;			//顶点数
	//##ModelId=40863F410350
	int * x;		//当前解
	//##ModelId=40863F410364
	int * bestx;	//当前最优解
	//##ModelId=40863F410382
	int ** a;		//临接矩阵
	//int * city;		//所有的城市
	//##ModelId=40863F4103A0
	int cc;			//当前费用
	//##ModelId=40863F4103BF
	int bestc;		//当前最优值
};

#endif // !defined(AFX_TRAVELING_H__D8AE81E7_BB48_4A6E_ACD6_4A6368429B12__INCLUDED_)