cmaptsp.h

来自「使用遗传算法解决tsp问题,vc++6.0实现」· C头文件 代码 · 共 98 行

#ifndef CMAPTSP_H
#define CMAPTSP_H

//////////////////////////////////////////////////////////////////
//
//	Name:	CmapTSP.h
//
//	Author: Mat Buckland
//
//	Desc:	Class for calculating city positions and the distances
//			between them.
//
///////////////////////////////////////////////////////////////////


#include <vector>

#include "utils.h"
#include "defines.h"

using namespace std;



const double pi = 3.1415926535897;


//---------------------------------------------------------
//	define a simple struct to hold the coordinates of each
//	city
//---------------------------------------------------------
struct CoOrd
{
	float x, y;
	
	CoOrd(){}
	CoOrd(float a, float b):x(a),y(b){}
};


//---------------------------------------------------------------
// definition of the map class
//---------------------------------------------------------------
class CmapTSP
{
private:
	
  //number of cities in the problem
	int				m_NumCities;

	//client window dimensions
	int				m_MapWidth;
	int				m_MapHeight;

	//holds the length of the solution, if one is calculable.
	double		m_dBestPossibleRoute;
	
	//calculate the coordinates of each city (positioned in a circle)
	void			CreateCitiesCircular();
	
  //calculates the distance between two cities	
  double		CalculateA_to_B(const CoOrd &city1, const CoOrd &city2);
	
	void			CalculateBestPossibleRoute();
	
	
public:

	//the city coordinates
  vector<CoOrd>	m_vecCityCoOrds;
	
	CmapTSP(int w, int h, int nc):m_MapWidth(w),
								                m_MapHeight(h),
								                m_NumCities(nc)
								
	{
		//calculate the co-ordinates for the cities
		CreateCitiesCircular();

		CalculateBestPossibleRoute();
	}


	//call this if user resizes client area
	void	  Resize(const int new_width, const int new_height);
	
	//calculates the tour length
  double	GetTourLength(const vector<int> &route);

	//accessor methods
	double	BestPossibleRoute() const {return m_dBestPossibleRoute;}
	
};




#endif