-
Notifications
You must be signed in to change notification settings - Fork 137
/
Copy pathbfs_dfs.cpp
93 lines (86 loc) · 2.11 KB
/
bfs_dfs.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
81
82
83
84
85
86
87
88
89
90
91
92
93
#include <iostream>
#include <vector>
#include <list>
#include <stack>
// Graph
class Graph
{
private:
std::vector<std::list<int>> adjList;
int vertices;
public:
Graph(int v)
{
this->vertices = v;
this->adjList.resize(v);
}
void addEdge(int source, int dest)
{
this->adjList[source].push_back(dest);
}
void bfs(int source)
{
std::list<int> queue;
std::vector<bool> visited;
visited.resize(this->vertices, false);
queue.push_back(source);
visited[source] = true;
std::cout << "\nBreadth First Search: ";
while (!queue.empty())
{
int curr = queue.front();
std::cout << " -> " << curr;
queue.pop_front();
for (auto vertex : this->adjList[curr])
{
if (!visited[vertex])
{
visited[vertex] = true;
queue.push_back(vertex);
}
}
}
}
void dfs(int source)
{
std::stack<int> s;
std::vector<bool> visited;
visited.resize(this->vertices, false);
s.push(source);
visited[source] = true;
std::cout << "\nDepth First Search: ";
while (!s.empty())
{
int curr = s.top();
std::cout << " -> " << curr;
s.pop();
for (auto vertex : this->adjList[curr])
{
if (!visited[vertex])
{
visited[vertex] = true;
s.push(vertex);
}
}
}
}
};
// main()
int main(int argc, char *argv[])
{
int vertices, edges, source, dest;
std::cout << "\nVertices & Egdes: ";
std::cin >> vertices >> edges;
std::cout << "Edges Source Destination: " << std::endl;
Graph graph(vertices);
for (int idx = 0; idx < edges; ++idx)
{
std::cin >> source >> dest;
graph.addEdge(source, dest);
}
std::cout << "\nSOurce: " << std::endl;
std::cin >> source;
graph.bfs(source);
graph.dfs(source);
return 0;
}