Advertisement
Guest User

Untitled

a guest
May 23rd, 2019
72
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.59 KB | None | 0 0
  1. #include <iostream>
  2. #include <fstream>
  3. using namespace std;
  4. ifstream f("BFS.in");
  5. ofstream g("BFS.out");
  6. int n,m,x,a[101][101],v[101],s,t,i;
  7. void bfs(int start)
  8. {
  9. int x[101],k,st,dr;
  10.  
  11. st=dr=1;
  12. x[1]=start;
  13. v[start]=1;
  14. g<<start<<" ";
  15. while(st<=dr)
  16. {
  17. k=x[st];
  18. for(i=1;i<=n;i++)
  19. if(v[i]==0 && a[k][i]==1)
  20. {
  21. v[i]=1;
  22. x[++dr]=i;
  23. g<<i<<" ";
  24. }
  25. st++;
  26. }
  27.  
  28. }
  29. int main()
  30. {
  31. f>>n>>m>>x;
  32. for(i=1;i<=m;i++)
  33. {
  34. f>>s>>t;
  35. a[s][t]=1;
  36. a[t][s]=1;
  37. }
  38. bfs(x);
  39. return 0;
  40. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement