1BM17CS007-ADA/graph.cpp at master · abhisheksurpur2/1BM17CS007-ADA · 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
#include<iostream>
#include <list>
using namespace std;


class Graph
{
    int V;


    list<int> *adj;


    void DFSUtil(int v, bool visited[]);
public:
    Graph(int V);
    void addEdge(int v, int w);
    void connectedComponents();
};


void Graph::connectedComponents()
{

    bool *visited = new bool[V];
    for(int v = 0; v < V; v++)
        visited[v] = false;

    for (int v=0; v<V; v++)
    {
        if (visited[v] == false)
        {

            DFSUtil(v, visited);

            cout << "\n";
        }
    }
}

void Graph::DFSUtil(int v, bool visited[])
{

    visited[v] = true;
    cout << v << " ";


    list<int>::iterator i;
    for(i = adj[v].begin(); i != adj[v].end(); ++i)
        if(!visited[*i])
            DFSUtil(*i, visited);
}

Graph::Graph(int V)
{
    this->V = V;
    adj = new list<int>[V];
}


void Graph::addEdge(int v, int w)
{
    adj[v].push_back(w);
    adj[w].push_back(v);
}


int main()
{
    int a,b,i,n;

    Graph g(5);
    cout<<"enter no of nodes a & b";
    cin>>n;
    cout<<"enter all nodes";
    for(i=0;i<n;i++){
        cin>>a>>b;
        g.addEdge(a,b);
    }


    cout << "Following are connected components \n";
    g.connectedComponents();

    return 0;
}