fork download
copy 
  1. #include<bits/stdc++.h>
  2. using namespace std;
  3. vector<int>graph[1001];
  4. int visit[1001];
  5. int n, e;
  6.  
  7. void BFS(int start)
  8. {
  9.     //Initial Step
  10.     visit[start] = 1;
  11.     cout<<start<<" ";
  12.     queue<int>Q;
  13.     Q.push(start);
  14.  
  15.     //Repeating Step
  16.     while(!Q.empty())
  17.     {
  18.         int x = Q.front();
  19.         Q.pop();
  20.         for(int j = 0; j < graph[x].size(); j++)
  21.         {
  22.             int node = graph[x][j];
  23.             if(visit[node] == 0)
  24.             {
  25.                 visit[node] = 1;
  26.                 cout<<node<<" ";
  27.                 Q.push(node);
  28.             }
  29.         }
  30.     }
  31. }
  32.  
  33. int main()
  34. {
  35.     cin>>n>>e;
  36.     int u, v;
  37.     for(int i = 1; i <= e; i++)
  38.     {
  39.         cin>>u>>v;
  40.         graph[u].push_back(v);
  41.         graph[v].push_back(u);
  42.     }
  43.     BFS(1);
  44. }
  45.  
Success #stdin #stdout 0.01s 5292KB
comments (?)
stdin
copy 
10 13
1 2
1 4
4 3
2 3
3 9
3 10
2 5
2 7
2 8
5 6
5 7
5 8
7 8
stdout
copy 
1 2 4 3 5 7 8 9 10 6
https://ideone.com/1A9ECE
language:
C++ (gcc 8.3)
created:
8 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!