alo1.h

模式识别经典算法

#ifndef Alo1_H
#define Alo1_H
#include<iostream>
#include<cmath>
using  std::cin;
using  std::cout;
using  std::endl;

struct Point
{
	float x;
	float y;
	int flag;
};

struct Data
{
	double x;
	int i;
	int j;
};

/*
struct List
{
	Point data;
	struct List *next;	
}Lnode,*Linklist;

*/

static Point pt[25];
static Point Kr[20];
static Point Kr1[20];
static double M[20];
static int Rec[21];
static Point Meen[21];
static double Meen_Max[21];
static Data Distance_Center[200];
static int K = 2,num_N = 1,L = 0,I = 4,Nc = 1;  //依次为聚类中心数目，最少样本数目，合并对数，迭代次数
static double Aver_S = 1, Distance = 4;         //聚类的标准方差，聚类中心的最小距离      
static int count = 1;
static const float Max = 100000;


int Init(int K,int num_N,double Aver_S,double Distance,int L,int I,int Nc); 
//int Init(int &K,int &num_N,double &Aver_S,double &Distance,int &L,int &I,int &Nc);   //第一步，初始化
double distance2(Point x,Point y);
int Distribute(int N);
//int Min_Distan_Sequence(int Number,Point &x);
int Min_Distan_Sequence(int Number,Point x);
int Average(int i,int j);         //第四步第五步第六步
int Split(int i,int j);
double Max_value(Point x);
int Dismense(int i,int N);
int Incorporate(int Nc,int N );

#endif