sortdlg.cpp

实现聚类算法中的K-MEANS算法

// SortDlg.cpp : implementation file
//

#include "stdafx.h"
#include "KMeansV.h"
#include "SortDlg.h"

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

/////////////////////////////////////////////////////////////////////////////
// CSortDlg dialog


CSortDlg::CSortDlg(CWnd* pParent /*=NULL*/)
	: CDialog(CSortDlg::IDD, pParent)
{
	//{{AFX_DATA_INIT(CSortDlg)
	m_bShowCenter = FALSE;
	m_nGroupNum = 0;
	m_nParam = 0;
	//}}AFX_DATA_INIT
}


void CSortDlg::DoDataExchange(CDataExchange* pDX)
{
	CDialog::DoDataExchange(pDX);
	//{{AFX_DATA_MAP(CSortDlg)
	DDX_Check(pDX, IDC_CHECK, m_bShowCenter);
	DDX_Text(pDX, IDC_GROUPNUM, m_nGroupNum);
	DDV_MinMaxInt(pDX, m_nGroupNum, 1, 32767);
	DDX_Text(pDX, IDC_PARAM, m_nParam);
	DDV_MinMaxInt(pDX, m_nParam, 1, 32767);
	//}}AFX_DATA_MAP
}


BEGIN_MESSAGE_MAP(CSortDlg, CDialog)
	//{{AFX_MSG_MAP(CSortDlg)
		// NOTE: the ClassWizard will add message map macros here
	//}}AFX_MSG_MAP
END_MESSAGE_MAP()

/////////////////////////////////////////////////////////////////////////////
// CSortDlg message handlers