数据结构1 -06-图3 六度空间

 

 

#include<stdio.h>
#include<string.h>
#define MAXN 1004
int g[MAXN][MAXN];
int n,m;
int queue[MAXN*10000],front,rear;
void read();
void BFS();
int isempty();
int addq(int x);
int enq();
int main(){
    int i;
    double t;
    read();
    BFS();
    for(i=1;i<=n;i++){
        t = (g[0][i]/ (double) n) * 100;
        printf("%d: %.2f%%\n",i,t);
    }
    return 0;
} 
void read(){
    scanf("%d %d",&n,&m);
    int i,j,v1,v2;
    for(i=1;i<=m;i++){
        scanf("%d %d",&v1,&v2);
        g[v1][v2] = 1;
        g[v2][v1] = 1;
    }
}

int addq(int x){
    if((rear+1)%MAXN==front) return -1;
    rear = (rear+1)%MAXN;
    queue[rear] = x;
    return 1;
} 
int enq(){
    if(front==rear) return -1;
    front = (front+1)%MAXN;
    return queue[front];
}
int isempty(){
    if(front==rear) return 1;
    else return 0;
}
void BFS(){
    int vis[MAXN],level[MAXN],value,i,j;
    
    for(i=1;i<=n;i++){
        g[0][i] = 0; memset(level,0,sizeof(level));
        memset(vis,0,sizeof(vis));
        front = -1; rear = -1; addq(i);
        vis[i] = 1;
        while(isempty()==0){
            value = enq();    
            if(level[value]>=7) break;
            else g[0][i]++;
            for(j=1;j<=n;j++){
                if(g[value][j]!=0&&value!=j&&vis[j]==0){
                    addq(j);
                    vis[j] = 1;
                    level[j] = level[value] + 1;
                }
            }    
        }    
    }
}