OpenSoure_Repos/TheAlgorithms-C-Plus-Plus
1
0
Fork 0
mirror of https://hub.njuu.cf/TheAlgorithms/C-Plus-Plus.git synced 2023-10-11 13:05:55 +08:00
Code Issues Packages Projects Releases Wiki Activity

Fix linter for connected_components_with_dsu

Browse Source
This commit is contained in:
Filip Hlásek 2020-08-03 23:41:48 -07:00
parent ac26555ec9
commit 95227af3bc
1 changed files with 6 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
graph/connected_components_with_dsu.cpp
View File

@ -13,8 +13,9 @@ void make_set() { // function the initialize every node as it's own parent
} }
// To find the component where following node belongs to // To find the component where following node belongs to
int find_set(int v) { int find_set(int v) {
if (v == parent[v]) if (v == parent[v]) {
return v; return v;
}
return parent[v] = find_set(parent[v]); return parent[v] = find_set(parent[v]);
} }
@ -22,8 +23,9 @@ void union_sets(int a, int b) { // To join 2 components to belong to one
a = find_set(a); a = find_set(a);
b = find_set(b); b = find_set(b);
if (a != b) { if (a != b) {
if (siz[a] < siz[b]) if (siz[a] < siz[b]) {
std::swap(a, b); std::swap(a, b);
}
parent[b] = a; parent[b] = a;
siz[a] += siz[b]; siz[a] += siz[b];
} }
@ -42,10 +44,10 @@ int main() {
parent.resize(N + 1); parent.resize(N + 1);
siz.resize(N + 1); siz.resize(N + 1);
make_set(); make_set();
int edges; int edges = 0;
std::cin >> edges; // no of edges in the graph std::cin >> edges; // no of edges in the graph
while (edges--) { while (edges--) {
int node_a, node_b; int node_a = 0, node_b = 0;
std::cin >> node_a >> node_b; std::cin >> node_a >> node_b;
union_sets(node_a, node_b); union_sets(node_a, node_b);
} }