Advertisement
Guest User

Untitled

a guest
Jan 19th, 2020
70
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.57 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. bool check[100001]={0};
  4. vector <int> ar[100001];
  5. bool dfs(int s){
  6. if(check[s]==true)
  7. return true;
  8. printf("%d ",s);
  9. check[s]=true;
  10. for(auto i:ar[s]){
  11. dfs(i);
  12. }
  13. }
  14. int main(){
  15.  
  16. int n,m;
  17. scanf("%d %d",&n,&m);
  18. for(int i=1;i<=m;i++){
  19. int u,v;
  20. scanf("%d %d",&u,&v);
  21. ar[u].push_back(v);
  22. ar[v].push_back(u);
  23. }
  24. for(int i=1;i<=n;i++) sort(ar[i].begin(),ar[i].end());
  25. int s;
  26. scanf("%d",&s);
  27. dfs(s);
  28.  
  29. return 0;
  30. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement