-
Notifications
You must be signed in to change notification settings - Fork 0
/
DFS using stack.cpp
60 lines (59 loc) · 1.01 KB
/
DFS using stack.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
#include<bits/stdc++.h>
using namespace std;
int cost[10][10],i,j,k,n,visit[10],visited[10],top;
int main()
{
int stk[10];
int m,v;
cout <<"Enter number of vertex : ";
cin >> n;
cout <<"Enter number of edges : ";
cin >> m;
cout <<"Enter ages EDGES : \n";
for(k=1;k<=m;k++)
{
cin >>i>>j;
cost[i][j]=1;
}
cout <<"Enter source vertex : ";
cin >>v;
cout <<"Traverse Order : \n";
cout << v << " ";
visited[v]=1;
k=1;
while(k<n)
{
for(j=n;j>=1;j--)
{
if(cost[v][j]!=0 && visited[j]!=1 && visit[j]!=1)
{
visit[j]=1;
stk[top]=j;
top++;
}
}
v=stk[--top];
cout<<v << " ";
k++;
visit[v]=0; visited[v]=1;
}
return 0;
}
/*
Sample input output :
Enter number of vertex : 9
Enter number of edges : 9
Enter ages EDGES :
1 2
2 3
1 5
1 4
4 7
7 8
8 9
2 6
5 7
Enter source vertex : 1
Traverse Order :
1 2 3 6 4 7 8 9 5
*/