DS-Assignment/Graph.cpp at master · geeky1Coder/DS-Assignment · GitHub

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
#include <bits/stdc++.h>
using namespace std;

class Graph
{
public:
	vector<int> *adj;
	int size;
	Graph(int n)
	{
		adj = new vector<int>[n];
		size = n;
	}
	void addEdge(int from, int to)
	{
		adj[from].push_back(to);
	}
};
void dfs_util(vector<int> adj[], int i, bool visited[])
{
	visited[i] = true;
	cout << i << " ";
	for (auto it = adj[i].begin(); it != adj[i].end(); ++it)
	{
		if (!visited[*it])
		{
			dfs_util(adj, *it, visited);
		}
	}
}
void dfs(vector<int> adj[], int n, int start)
{
	bool visited[n];
	for (int i = 0; i < n; ++i)
	{
		visited[i] = false;
	}
	for (int i = 0; i < n; ++i)
	{
		if (!visited[i])
		{
			dfs_util(adj, i, visited);
		}
	}
}
//Breadth First Search
void bfs(vector<int> adj[], int n, int start, bool visited[])
{
	std::queue<int> q;
	q.push(start); //start node

	while (!q.empty())
	{
		int el = q.front();
		cout << el << " ";
		visited[el] = true;
		q.pop();
		for (auto it = adj[el].begin(); it != adj[el].end(); ++it)
		{
			if (visited[*it] == false)
			{
				q.push(*it);
			}
		}
	}
}

int main()
{
	Graph g(4);
	g.addEdge(0, 1);
	g.addEdge(0, 2);
	g.addEdge(2, 1);
	g.addEdge(3, 1);
	bool visited[g.size];
	for (int i = 0; i < g.size; ++i)
	{
		visited[i] = false;
	}
	for (int i = 0; i < g.size; ++i)
	{
		if (!visited[i])
		{
			bfs(g.adj, g.size, i, visited);
		}
	}
	cout << endl;
	dfs(g.adj, g.size, 0);
	cout << endl;
	return 0;
}