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

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <queue>
using namespace std;
typedef long long ll;
const int inf = 0x3fffff;
int gra[200][200];
int vis[200];
int path[200];
int n,m,k,t;
void bfs(int s)
{
    memset(vis,0,sizeof(vis));
    memset(path,-1,sizeof(path));
    queue<int>q;
    vis[s] = 1;
    q.push(s);
    int top = 0;
    path[top ++ ] = s;
    while(!q.empty())
    {
        int now = q.front();
        q.pop();
        for(int i = 0; i < k; i ++)
        {
            if(gra[now][i] == 1&& vis[i] == 0)
            {
                q.push(i);
                vis[i] = 1;
                path[top ++] = i;
            }
        }
    }
    for(int i = 0; i < top; i ++)
    {
        if(i == 0)
            printf("%d",path[i]);
        else
            printf(" %d",path[i]);
    }
    printf("
");
}
int main()
{
    int u,v;
    scanf("%d",&n);
    while(n --)
    {
        scanf("%d%d%d",&k,&m,&t);
        memset(gra,0,sizeof(gra));
        for(int i = 0; i < m; i ++)
        {
            scanf("%d%d",&u,&v);
            gra[u][v] = gra[v][u] = 1;
        }
        bfs(t);
    }
    return 0;
}