模糊C聚类的一个算法例子

#include<stdio.h>
#include<math.h>
#include<stdlib.h>

#define C 7
#define B 2
#define NUM 30

typedef struct
{
double x;
double y;
double z;
double u[C];
double dis[C];
}Sample;

Sample smp[NUM];
double m[C][3];

void init()
{
int i,j,k;
double a[30][3]={-5.01,-8.12,-3.68,-5.43,-3.48,-3.54,1.08,-5.52,1.66,0.86,-3.78,-4.11,-2.67,0.63,7.39,
                  4.94,3.29,2.08,-2.51,2.09,-2.59,-2.25,-2.13,-6.94,5.56,2.86,-2.26,1.03,-3.33,4.33,
                      -0.91,-0.18,-0.05,1.30,-2.06,-3.53,-7.75,4.54,-0.95,-5.47,0.50,3.92,6.14,5.72,-4.85,
                  3.60,1.2,4.36,5.37,-4.63,-3.65,7.18,1.46,-6.66,-7.39,1.17,6.30,-7.50,-6.32,-0.31,
                      5.35,2.26,8.13,5.12,3.22,-2.66,-1.34,-5.31,-9.87,4.48,3.42,5.19,7.11,2.39,9.21,
                  7.17,4.33,-0.98,5.75,3.97,6.65,0.77,0.27,2.41,0.90,-0.43,-8.71,3.52,-0.36,6.43};

for(k=0;k<NUM;k++)
{
smp[k].x=a[k][0];
smp[k].y=a[k][1];
smp[k].z=a[k][2];
}
for(i=0;i<NUM;i++)
{
for(j=0;j<C;j++)
{
smp[i].dis[j]=0;
            smp[i].u[j]=0;
        }
}
}

void init_m()
{
int i;
for(i=0;i<C;i++)
{
m[i][0]=smp[i].x;
m[i][1]=smp[i].y;
m[i][2]=smp[i].z;
}
}

void Distance()
{
int i,j;