program.c

这是复杂网络研究中研究小世界性质的c程序2。

#include<stdio.h>
#include<math.h>
#include<stdlib.h>
#define N 3939
#define n 50
#define m 100
main()
{
FILE *fp1,*fp2,*fp3,*fp4;
int i,j,k,l,d,r;
static int degree[N],adjmatrix[N][N],diameter[N][N],deg1[N],deg2[N],tag[m],geograph[N][N],lspace[N][N];
static float proba[N];
float x,resum;    double sum;
double sum1,sum2,sum3,sum0;
int p,q,degt[N],degf[N];
float clu[N],degcorr[N];

fp1=fopen("beijing.dat","r");
fp2=fopen("degree.txt","w");
fp3=fopen("deg-geo.txt","w");
fp4=fopen("deg-lsp.txt","w");
i=0; k=0; l=1;
while(!feof(fp1))
 { i++;
  fscanf(fp1,"%d",&r);
  if(r>0)
     {  if(k>0)
       { 
          printf("%d %d %d\n",k,r,j);
         for(p=0;p<j;p++)
         {geograph[tag[p]][tag[p+1]]=geograph[tag[p+1]][tag[p]]=1;
          for(q=p+1;q<=j;q++)
           {lspace[tag[p]][tag[q]]=lspace[tag[q]][tag[p]]=1;
           }
          }
        }
        
      tag[0]=r; degree[r]++;
      j=0;
      k++;

     }
     if(r==4000)break;
     if(-r>N)printf("%d %d\n",r,k);
//     printf("%d\n",r);
   if(r<0)
     {
      tag[++j]=-r; degree[-r]++;
     }
 }
 printf("%d\n",i);
  for(i=1;i<N;i++)
   {for(j=1;j<N;j++)
     { deg1[i]=deg1[i]+geograph[i][j];
       deg2[i]=deg2[i]+lspace[i][j];
     }
    fprintf(fp2,"%d\n",degree[i]);
    fprintf(fp3,"%d\n",deg1[i]); 
    fprintf(fp4,"%d\n",deg2[i]);
   }
   
     printf("I love you\n");

}