maptsp.h

来自「用c+++实现的遗传算法解决tsp（旅行商）问题源码」· C头文件 代码 · 共 63 行

#ifndef __INC_MAPTSP_H__
#define __INC_MAPTSP_H__

#include <vector>
#include "chbUtils.h"
#include "define.h"

using namespace std;

const double pi = 3.1415926535897;


struct CoOrd
{
	float x, y;

	CoOrd()
	{
	}

	CoOrd( float a, float b ) : x( a ), y( b )
	{
	}
};

class CmapTSP
{
private:
	int  m_NumCities;
	int  m_MapWidth;
	int  m_MapHeight;

	double m_dBestPossibleRoute;

	void CreateCitiesCircular();

public:
	vector<CoOrd> m_vecCityCoOrds;

	CmapTSP( int w, int h, int nc ) : m_MapWidth( w ), m_MapHeight( h ), m_NumCities( nc )
	{
		CreateCitiesCircular();

		CalculateBestPossibleRoute();
	}

	void Resize(const int new_width, const int new_height);

	double GetTourLength( const vector<int> &route );

	double CalculateA_to_B(const CoOrd &city1, const CoOrd &city2);

	void CalculateBestPossibleRoute();

	double BestPossibleRoute() const 
	{
		return m_dBestPossibleRoute;
	}
};

#endif //__INC_MAPTSP_H__