fun.h

模式识别k_means聚类算法。

#ifndef _FUN_H__
#define _FUN_H__

template < class T>
extern double dis(T *point1, T * point2, int n)
{
	T* v1 = point1;
	T* v2 = point2;
	double d2 = 0;//, d;
	for(int i = 0; i < n ; i++)
	{
		d2 += (*v1 - *v2) * (*v1 - *v2);
		v1++;
		v2++;
	}
//	d = sqrt(d2);
//  return d;
	return d2;
};

//找到两个相距最远的点.返回两个点的id.
template <class T>
extern void find_two_points(T* data, int dim , int g_num, int P_num, int* id1, int* id2)
{
	double distance = 0;
	double Max_d = 0;

	int p1, p2;

	for(int i = 0; i < P_num; i++)
	{
		for (int j = i + 1; j < P_num; j++)
		{
			if ((distance = dis(&data[i*dim], &data[j*dim], dim)) > Max_d)
			{
				Max_d = distance;
				p1 = i;
				p2 = j;
			}
		}
	}
	*id1 = p1;
	*id2 = p2;
};

#endif