-
Notifications
You must be signed in to change notification settings - Fork 0
/
num_of_connected_graph.cpp
69 lines (61 loc) · 1.13 KB
/
num_of_connected_graph.cpp
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
#include <iostream>
#include <string>
#include <stack>
#include <vector>
#include <list>
using namespace std;
class Graph {
int V;
list<int> *adj;
void dfs(int v, bool visited[]);
public:
Graph(int v);
~Graph();
void add_edges(int v, int w);
void connected_components();
};
Graph::Graph(int v)
{
V = v;
adj = new list<int>[v];
}
Graph::~Graph()
{
delete[] adj;
}
void Graph::add_edges(int v, int w)
{
adj[v].push_back(w);
adj[w].push_back(v);
}
void Graph::dfs(int v, bool visited[])
{
visited[v] = true;
cout << v << " ";
list<int>::iterator it;
for (it = adj[v].begin(); it != adj[v].end(); it++) {
if (!visited[*it])
dfs(*it, visited);
}
}
void Graph::connected_components()
{
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]) {
dfs(v, visited);
cout << "\n";
}
}
delete[] visited;
}
int main()
{
Graph g(5);
g.add_edges(0, 1);
g.add_edges(1, 2);
g.add_edges(3, 4);
g.connected_components();
}