DataStructures-and-Algorithims/dfs.cpp at main · shivam228/DataStructures-and-Algorithims · 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
#include <iostream>
#include <bits/stdc++.h>
using namespace std;

vector<int> adj[5];

void addEdge(vector<int> adj1[], int u, int v)
{
    adj1[u].push_back(v);
    adj1[v].push_back(u);
}

void dfs(bool vis[5],int v)
{
	vis[v]  = true;
	cout<<v;
	 for (int x=0;x<adj[v].size();x++)
	 {
	 	if(vis[adj[v][x]]==false)
	 	{
	 		dfs(vis,adj[v][x]);
		 }
	  }
	  return;
}
int main()
{

    addEdge(adj, 0, 1);
    addEdge(adj, 0, 4);
    addEdge(adj, 1, 2);
    addEdge(adj, 1, 3);
    addEdge(adj, 1, 4);
    addEdge(adj, 2, 3);
    addEdge(adj, 3, 4);
    bool vis[5];
    for(int i =0;i<5;i++)
    {
    	vis[i] = false;
	}
    dfs(vis,0);


    return 0;
}