第一道A的BFS 。。。。SDUT的BFS水题联系

#include<stdio.h>
#include<string.h>
int map[105][105];
int q[210];
int pro[105];
int fro;
int re;
int main()
{
    int d,e,s,i,j,a,b,t;
    scanf("%d",&t);
    while(t--)
    {
        memset(map,0,sizeof(map));
        memset(pro,0,sizeof(pro));
        scanf("%d %d %d",&d,&e,&s);
        for(i = 0;i < e;i++)
        {
            scanf("%d %d",&a,&b);
            map[a][b] = 1;
            map[b][a] = 1;
        }

        fro = 0;
        re = 0;
        pro[s] = 1;
        q[re++] = s;
        while(re < d)
        {
            int v = q[fro++];
            for(i = 0;i < d;i++)
            {
                if(map[v][i] == 1 && !pro[i])
                {
                    q[re++] = i;
                    pro[i] = 1;
                }
            }
        }
        fro = 0;
        for(i = 0;i < d-1;i++)
        {
            printf("%d ",q[i]);
        }
        printf("%d\n",q[i]);
    }

    return 0;
}