fork download
copy 
  1. #include<bits/stdc++.h>
  2. using namespace std;
  3. int graph[1001][1001];
  4. int visit[1001];
  5. int n, e;
  6.  
  7. void DFS_Stk(int start)
  8. {
  9.     //Initial Step
  10.     visit[start] = 1;
  11.     cout<<start<<" ";
  12.     stack<int>S;
  13.     S.push(start);
  14.     //Repeating Step
  15.     while(!S.empty())
  16.     {
  17.         for(int j = 1; j <= n; j++)
  18.         {
  19.             int x = S.top();
  20.             if(visit[j] == 0 && graph[x][j] != 0)
  21.             {
  22.                 visit[j] = 1;
  23.                 cout<<j<<" ";
  24.                 S.push(j);
  25.                 j = 1;
  26.             }
  27.         }
  28.     S.pop();
  29.     }
  30. }
  31.  
  32.  
  33.  
  34.  
  35.  
  36.  
  37. int main()
  38. {
  39.     cin>>n>>e;
  40.     int u, v;
  41.     for(int i = 1; i <= e; i++)
  42.     {
  43.         cin>>u>>v;
  44.         graph[u][v] = 1;
  45.         graph[v][u] = 1;
  46.     }
  47.     DFS_Stk(1);
  48.     //DFS_Rec(1);
  49.  
  50.  
  51.  
  52.  
  53.  
  54.  
  55. }
  56.  
Success #stdin #stdout 0s 5308KB
comments (?)
stdin
copy 
10 13
1 2
1 4
2 3
3 4
3 10
3 9
2 5
5 6
5 7
5 8
2 7
2 8
7 8
stdout
copy 
1 2 3 4 9 10 5 6 7 8
https://ideone.com/Q4UGit
language:
C++ (gcc 8.3)
created:
10 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!