-
Notifications
You must be signed in to change notification settings - Fork 0
/
disjoint_set.cpp
52 lines (43 loc) · 713 Bytes
/
disjoint_set.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
#include <iostream>
#include <vector>
#include <cassert>
#include "disjoint_set.hpp"
using namespace std;
DisjointSet::DisjointSet(int n) :
parent(n),
ht(n),
sz(n)
{
for (int i = 0; i < n; i++) {
parent[i] = i;
ht[i] = 0;
sz[i] = 1;
}
}
int DisjointSet::get_size(int i)
{
return sz[i];
}
int DisjointSet::find(int i)
{
if (i != parent[i]) {
parent[i] = find(parent[i]);
}
return parent[i];
}
void DisjointSet::merge(int i, int j)
{
int i_id = find(i);
int j_id = find(j);
if (i_id == j_id) return;
if (ht[i_id] > ht[j_id]) {
parent[j_id] = i_id;
sz[i_id] += sz[j_id];
} else {
parent[i_id] = j_id;
if (ht[i_id] == ht[j_id]) {
ht[j_id]++;
}
sz[j_id] += sz[i_id];
}
}