alg.h

分级聚类算法

//#include "stdafx.h"
#include <vector>
#include <CMath>

#if   _MSC_VER   >   1000   
#pragma   once   
#endif   //   _MSC_VER   >   1000   

#if   _MSC_VER   >   1020       //   if   VC++   version   is   >   4.2   
using   namespace   std;     //   std   c++   libs   implemented   in   std   
#endif

typedef vector<CPoint> PNTVECTOR;
typedef vector<PNTVECTOR> VECTORLIST;
//vector<VECTORLIST> pnts;

inline int GetDis(CPoint a, CPoint b)
{
	return sqrt((a.x - b.x)*(a.x - b.x)+(a.y - b.y)*(a.y - b.y));
}

inline CPoint GetCenter(CPoint a, CPoint &b)
{
	CPoint rt;
	rt.x=(a.x + b.x)/2;
	rt.y=(a.y + b.y)/2;
	return rt;
}

BOOL GradeCluser(VECTORLIST &pnts, int n);