kmeans算法

void k_means()
{
size_t size;
    //double  _min_change;
    //double  _min_max_change=0.0;
double   min_change=10.0;//连续两次迭代的变化
int set_number=0;//聚类序号
    for (int i0=0;i0<max_layer;i0++)
for (int i1=0;i1<max_node;i1++)
for (int i2=0;i2<max_node;i2++)
        w[i0][i1][i2]=randnumber();//初始化权值
 for(int ii=1;ii<C_BUF;ii++)
theita[ii]=NULL;//指针初始化
 fp=fopen("study.txt","r");
 if (fp==NULL)
 {
 cout<<"cannot open file"<<endl;      
         exit(0);
 }
int _i=0;
while (!feof(fp))
{
for(int _j=1;_j<N_BUF;_j++)
{
fscanf(fp,"%f",input+_j);
w[1][_i][_j]=input[_j];
}

while (!feof(fp)&&(fgetc(fp)!='\n'))
;