dlgpara.cpp

求解静态TSP 的IGT算法

// DlgPara.cpp : implementation file
//

#include "stdafx.h"
#include "STAT.h"
#include "DlgPara.h"

#ifdef _DEBUG
#define new DEBUG_NEW
#undef THIS_FILE
static char THIS_FILE[] = __FILE__;
#endif

/////////////////////////////////////////////////////////////////////////////
// CDlgPara dialog


CDlgPara::CDlgPara(CWnd* pParent /*=NULL*/)
	: CDialog(CDlgPara::IDD, pParent)
{
	//{{AFX_DATA_INIT(CDlgPara)
	m_edgeSpeed = 5000;
	m_maxGen =80000;
	m_NOCHANGE = 20000;
	m_probab1 = 0.02;
	m_probab2 = 0.05;
	m_xCity = 144;
	m_xColony = 80;
	//}}AFX_DATA_INIT
}


void CDlgPara::DoDataExchange(CDataExchange* pDX)
{
	CDialog::DoDataExchange(pDX);
	//{{AFX_DATA_MAP(CDlgPara)
	DDX_Text(pDX, IDC_EDIT_edgeSpeed, m_edgeSpeed);
	DDX_Text(pDX, IDC_EDIT_maxGen, m_maxGen);
	DDX_Text(pDX, IDC_EDIT_NOCHANGE, m_NOCHANGE);
	DDX_Text(pDX, IDC_EDIT_probab1, m_probab1);
	DDX_Text(pDX, IDC_EDIT_probab2, m_probab2);
	DDX_Text(pDX, IDC_EDIT_xCity, m_xCity);
	DDX_Text(pDX, IDC_EDIT_xColony, m_xColony);

	DDV_MinMaxDouble(pDX, m_probab1,0.00,1.00);
	DDV_MinMaxDouble(pDX, m_probab2,0.00,1.00);
	DDV_MinMaxInt(pDX, m_xCity,3,1000);
	DDV_MinMaxInt(pDX, m_xColony,2,1000);


	//}}AFX_DATA_MAP
}


BEGIN_MESSAGE_MAP(CDlgPara, CDialog)
	//{{AFX_MSG_MAP(CDlgPara)
	//}}AFX_MSG_MAP
END_MESSAGE_MAP()

/////////////////////////////////////////////////////////////////////////////
// CDlgPara message handlers

void CDlgPara::OnOK() 
{
	// TODO: Add extra validation here
	UpdateData(TRUE);
	//if(m_xColony>90){AfxMessageBox("2-200");return;}

	node->xCity=m_xCity;
	node->xColony=m_xColony;
    node->edgeSpeed=m_edgeSpeed;
	node->probab1=m_probab1;
	node->probab2=m_probab2;
	node->NOCHANGE=m_NOCHANGE;
    node->maxGen=m_maxGen;


	CDialog::OnOK();



}

void CDlgPara::setVar(Node *nod)
{
	node=nod;
}