-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathConnectedComponent.cpp
More file actions
105 lines (90 loc) · 2 KB
/
ConnectedComponent.cpp
File metadata and controls
105 lines (90 loc) · 2 KB
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
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
#include <bits/stdc++.h>
using namespace std;
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("-ffloat-store")
#pragma GCC optimize ("Ofast")
static auto _ = [] () {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
return 0;
}();
#define frw(i, len) for(ll i = 0 ; i < len ; i++)
#define frb(i, len) for(ll i = len ; i >= 0 ; i--)
#define YES cout<<"Yes \n";
#define NOO cout<<"No \n";
#define nl cout<<"\n";
#define MAX_SIZE 10000
#define nptr nullptr
typedef stringstream strgm;
typedef long long int ll;
typedef const int c_int;
typedef unsigned unsg;
typedef double dbl;
typedef vector<vector<string>> vvstr;
typedef vector<vector<bool>> vvbl;
typedef vector<vector<int>> vvint;
typedef vector<vector<ll>> vvll;
typedef vector<string> vstr;
typedef vector<int> vint;
typedef vector<bool> vbl;
typedef vector<ll> vll;
typedef stack<string> sstr;
typedef stack<bool> sbl;
typedef stack<int> sint;
typedef stack<ll> sll;
typedef queue<string> qstr;
typedef queue<bool> qbl;
typedef queue<int> qint;
typedef queue<ll> qll;
c_int MOD=1e9 + 7;
c_int Mx_row=100;
c_int Mx_col=100;
int size_stack=0;
int InvrsnCnt=0;
int size_arr=0;
int size_ll=0;
int top=-1;
c_int N = 1e5 + 10;
vint g[N];
vbl vis(N,false);
vvint cc;
vint curr_cc;
void dfs(int vrtx){
vis[vrtx] = true;
curr_cc.push_back(vrtx);
for(auto child : g[vrtx]){
if(vis[child]){
continue;
}
dfs(child);
}
}
int main(){
int Nodes,Edges;
cin>>Nodes>>Edges;
for (int i=0;i<Edges;i++){
int v,u;
cin>>v>>u;
g[v].push_back(u);
g[u].push_back(v);
}
int cnt = 0;
for(int i=1;i<Nodes;i++){
if(vis[i]){
continue;
}
curr_cc.clear();
dfs(i);
cc.push_back(curr_cc);
cnt += 1;
}
for(auto c_cc: cc){
for(auto vrtx : c_cc){
cout<<vrtx<<" ";
}
nl;
}
return 0;
}