graph/dfs.cpp at master · sandhya-04/graph · 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
#include<bits/stdc++.h>
using namespace std;
template<typename T>
class graph{
    map<int,list<T> >l;
  public:
  void addedge(int x,int y){
      l[x].push_back(y);
      l[y].push_back(x);
  }
  void dfs_helper(T src,map<int,bool> &vis)
  {
      cout<< src <<" ";
      vis[src]=true;

      for(auto p:l[src]){
          if(!vis[p])
          {
              vis[p]=true;
              dfs_helper(p,vis);
          }
      }
  }
  void dfs(T src){
      map<int,bool>vis;
      for(auto s:l)
      {
          T nbr=s.first;
          vis[nbr]=false;
      }
      dfs_helper(src,vis);
  }

};
int main()
{
    graph<int>g;
    g.addedge(2,1);
	g.addedge(2,3);
	g.addedge(3,2);
	g.addedge(3,0);
	g.addedge(1,2);
	g.addedge(1,0);
	g.addedge(0,1);
	g.addedge(3,4);
	g.addedge(4,3);
	g.addedge(4,5);
	g.addedge(5,4);
	g.dfs(0);
}