1703：BFS广搜

解题思路:

注意事项:

参考代码:

#include<bits/stdc++.h>

using namespace std;

int a[51][51];

int visited[51];

int n;

void bfs(int v)

{

             queue <int> q;

             visited[v]=1;

             q.push(v);

             while(!q.empty())

             {

                     int u=q.front();//取队首元素

                     q.pop(); //出队 

                     cout<<u<<" ";

                     for(int w=0;w<n;w++)

                     {

                             if(a[u][w]==1 && visited[w]==0)

                             {

                                         q.push(w);

                                         visited[w]=1;

                             }

                     }

             }

}

int main()

{

             cin>>n;

             for(int i=0;i<n;i++)

             for(int j=0;j<n;j++)

             cin>>a[i][j];

             bfs(0);

             return 0;

}