citylayout.cpp

TSP问题（Travelling Salesman Problem）是数学领域中著名问题之一,旅行商的VC算法实现

#include "CityLayout.h"
namespace evo
{
CityLayout::CityLayout(void)
{
	
}

CityLayout::CityLayout(int * st,int length)
:bufferstart(st),bufferlength(length)
{
}

CityLayout::~CityLayout(void)
{
}

int CityLayout::getDistance(const int city1,const int city2)
{
	if(city1<0 || city1>CITY_COUNT-1 || city2 <0 || city2>CITY_COUNT-1 )
		return -1;

	int move=city1*CITY_COUNT+city2;
	if(move<bufferlength)
		return *(bufferstart + move);
	else
		return -1;
}

	int distance[CITY_COUNT][CITY_COUNT]={0,26,28,4,37,39,8,33,6,
										  26,0,5,22,26,24,20,8,24,
										  28,5,0,24,21,20,21,8,26,
										  4,22,24,0,34,36,5,30,5,
										  37,26,21,34,0,6,30,26,38,
										  39,24,20,36,6,0,32,23,40,
										  8,20,21,5,30,32,0,27,9,
										  33,8,8,30,26,23,27,0,31,
										  6,24,26,5,38,40,9,31,0};

	
	int *pd=&distance[0][0];
	CityLayout layout(pd,CITY_COUNT*CITY_COUNT);
}