Competitive-Coding/dfs.cpp at master · psdhanesh7/Competitive-Coding · 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
#include<iostream>
using namespace std;

void printDFS(int **edges, int v, int sv, bool *visited)
{
	cout << sv << " " ;
	visited[sv] = true;

	for(int i = 0; i < v; i++)
	{
		if(edges[sv][i] == 1 && !visited[i]){
			printDFS(edges, v, i, visited);
		}
	}
}

void DFS(int **edges, int v)
{
	bool *visited = new bool[v];
	for(int i = 0; i < v; i++){
		visited[i] = false;
	}

	for(int i = 0; i < v; i++){
		if(!visited[i])
			printDFS(edges, v, i, visited);
	}

	delete [] visited;
}

int main()
{
	int v;
	int e;
	cin >> v >> e;

	int **edges = new int*[v];
	for(int i = 0; i < v; i++)
	{
		edges[i] = new int[v];
		for(int j = 0; j < v; j++)
		{
			edges[i][j] = 0;
		}
	}

	for(int i = 0; i < e; i++)
	{
		int f, s;
		cin >> f >> s;
		edges[f][s] = 1;
		edges[s][f] = 1;
	}

	DFS(edges, v);

	for(int i = 0; i < v; i++){
		delete [] edges[i];
	}

	delete [] edges;
	return 0;
}