SDUT OJ 2141 基于邻接矩阵的BFS

基于邻接矩阵的BFS：

 # include <stdio.h>
 # include <string.h>
 # include <queue>
 # include <iostream>
 # include <algorithm>
 # define N 1010
 using namespace std;
 
 int map[N][N];
 int vis[N], p[N];
 queue<int>q;
 int t = 0, n;
 
 void BFS(int s)
 {
     vis[s] = 1;
     for(int i = 0; i < n; i++)
     {
         if(!vis[i] && map[s][i])
         {
             q.push(i);
             vis[i] = 1;
         }
     }
     while(!q.empty())
     {
         int u = q.front();
         q.pop();
         p[t++] = u;
         BFS(u);
     }
 }
 
 int main(void)
 {
     int m, s, u, v, o;
     cin >> o;
     while(o--)
     {
         cin >> n >> m >> s;
         memset(vis, 0, sizeof(v));
         memset(map, 0, sizeof(map));
         for(int i = 0; i < m; i++)
         {
             cin >> u >> v;
             map[u][v] = 1;
             map[v][u] = 1;
         }
         q.push(s);
         BFS(s);
         for(int i = 0; i < t-1; i++)
             cout << p[i] << " ";
         cout << p[t-1] << endl;
     }
 
     return 0;
 }