fork download
copy 
  1. #include <iostream>
  2. #include<queue>
  3. using namespace std;
  4.  
  5. void bfstraversal(int graph[5][5])
  6. {
  7. queue <int> q;
  8. bool visited[10];
  9. int source=4;
  10. for(int i=0;i<5;i++)
  11. {
  12. visited[i]=false;
  13. }
  14. q.push(source);
  15. visited[source]=true;
  16. while(!q.empty())
  17. {
  18. int v=q.front();
  19. q.pop();
  20. printf("%d ",v);
  21. for(int i=0;i<5;i++)
  22. {
  23. if(!visited[i] && graph[v][i])
  24. {
  25. q.push(i);
  26. visited[i]=true;
  27. }
  28. }
  29. }
  30. }
  31.  
  32. int main()
  33. {
  34. int graph[5][5]={{0,1,1,0,0},
  35.                 {1,0,1,1,0},
  36.                 {1,1,0,0,1},
  37.                 {0,1,0,0,1},
  38.                 {0,0,1,1,0}};
  39.     bfstraversal(graph);
  40.     return 0;
  41. }
  42.  
  43.  
Success #stdin #stdout 0.01s 5284KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
4 2 3 0 1
https://ideone.com/LawIHN
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!