Advertisement
heian

Untitled

May 29th, 2019
75
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.78 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2.  
  3. using namespace std;
  4.  
  5. int n,m;
  6. bool viz[100003];
  7. vector<int>L[100003];
  8.  
  9. void Citire()
  10. {
  11. int x,y;
  12. ifstream fin ("date.in");
  13. fin>>n>>m;
  14. for(int i=1;i<=m;i++)
  15. {
  16. fin>>x>>y;
  17. L[x].push_back(y);
  18. L[y].push_back(x);
  19. }
  20. fin.close();
  21. }
  22. bool exista_ciclu = false;
  23.  
  24. void DFS(int x, int t)
  25. {
  26. viz[x] = true;
  27. unsigned int i;
  28. for(i=0;i<L[x].size();++i)
  29. {
  30. int y = L[x][i];
  31. if(y!=t)
  32. {
  33. if(viz[y]==true)
  34. exista_ciclu = true;
  35. else
  36. DFS(y,x);
  37. }
  38. }
  39. }
  40.  
  41. int main()
  42. {
  43. Citire();
  44. for(int i=1;i<=n;++i)
  45. if(!viz[i])
  46. DFS(i,0);
  47. cout<<exista_ciclu<<"\n";
  48. return 0;
  49. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement