Advertisement
Guest User

Untitled

a guest
Nov 14th, 2019
130
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.70 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2.  
  3. using namespace std;
  4.  
  5. ifstream f("BFS.in");
  6. ofstream g("BFS.out");
  7.  
  8. int n,m,q[101],viz[101],a[101][101],T,u,p;
  9.  
  10. void citire()
  11. {
  12. f>>n>>m>>T;
  13. for(int i=1; i<=m; i++)
  14. {
  15. int x,y;
  16. f>>x>>y;
  17. a[x][y]=a[y][x]=1;
  18. }
  19. }
  20.  
  21. void BfS(int start)
  22. {
  23. q[1]=start;
  24. viz[start]=1;
  25. p=u=1;
  26.  
  27. while(p<=u)
  28. {
  29. int x=q[p];
  30. p++;
  31. for(int i=1; i<=n; i++)
  32. if(a[x][i]==1 && viz[i]==0)
  33. {
  34. q[++u]=i;
  35. viz[i]=1;
  36. }
  37. }
  38.  
  39. for(int i=1; i<=u; i++)
  40. g<<q[i]<<" ";
  41. }
  42.  
  43. int main()
  44. {
  45. citire();
  46. BfS(T);
  47. return 0;
  48. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement