-
Notifications
You must be signed in to change notification settings - Fork 0
/
DFS-Graph_using-STACK.cpp
80 lines (66 loc) · 1.34 KB
/
DFS-Graph_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
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
#include <bits/stdc++.h>
using namespace std;
class Graph
{
private:
int v;
list<int> *graph;
public:
Graph(int v)
{
this->v = v;
graph = new list<int>[v];
}
void addEdges(int e1, int e2)
{
graph[e1].push_back(e2);
graph[e2].push_back(e1);
}
void display(int v)
{
cout << "List representation of the graph is : " << endl;
for (int i = 0; i < v; i++)
{
cout << i << " --> ";
for (auto v : graph[i])
cout << v << " ";
cout << endl;
}
}
void DFS(int source)
{
stack<int> s;
vector<int> visited(v, 0);
s.push(source);
visited[source] = 1;
cout << source << " ";
while (!s.empty())
{
int top = s.top();
s.pop();
for (auto v : graph[top])
{
if (!visited[v])
{
cout << v << " ";
visited[v] = 1;
s.push(v);
}
}
}
}
};
int main()
{
int v = 4;
Graph g(v);
g.addEdges(0, 1);
g.addEdges(0, 2);
g.addEdges(1, 2);
g.addEdges(2, 3);
g.display(v);
int source = 0;
cout << "BFS of the graph is : ";
g.DFS(source);
return 0;
}