SDUT- 2141 数据结构实验之图论一：基于邻接矩阵的广度优先搜索遍历

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
int a[105][105];
int vis[105];
int qu[10005], front, tail;
void init()
{
    memset(a, 0, sizeof(a));
    memset(vis, 0, sizeof(vis));
    front = tail = 0;
}
int main()
{
    int t, n, m, i, j, s;
    scanf("%d", &t);
    while(t--)
    {
        init();
        scanf("%d %d %d", &n, &m, &s);
        for(i = 1; i <= m; i++)
        {
            int u, v;
            scanf("%d %d", &u, &v);
            a[u][v] = a[v][u] = 1;
        }
        qu[tail++] = s;
        int flag = 0;
        while(front < tail)
        {
            int w = qu[front++];
            vis[w] = 1;
            if(flag == 0){printf("%d", w); flag = 1;}
            else printf(" %d", w);
            for(i = 0; i < n; i++)
            {
                if(a[w][i] == 1 && vis[i] == 0){qu[tail++] = i; vis[i] = 1;}
            }
        }
        printf("\n");
    }
    return 0;
}