-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathweighted-quick-union.h
60 lines (54 loc) · 1.01 KB
/
weighted-quick-union.h
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
class WQuickUnionUF
{
unsigned long int *id, *size;
unsigned long int idSize;
unsigned long int root(unsigned long int i)
{
while (i != id[i])
{
id[i] = id[id[i]];
i = id[i];
}
return i;
}
public:
// Constructor
WQuickUnionUF(unsigned long int N)
{
id = new unsigned long int[N];
size = new unsigned long int[N];
idSize = N;
for (unsigned long int i = 0; i < N; i++)
{
id[i] = i;
size[i] = 1;
}
}
// Destructor
~WQuickUnionUF()
{
delete[] id;
delete[] size;
}
bool connected(unsigned long int p, unsigned long int q)
{
return (root(p) == root(q));
}
void Union(unsigned long int p, unsigned long int q)
{
unsigned long int rootp = root(p);
unsigned long int rootq = root(q);
if (rootp == rootq)
return;
if (size[rootp] > size[rootq])
{
id[rootq] = rootp;
size[rootp] += size[rootq];
}
else
{
id[rootp] = rootq;
size[rootq] += size[rootp];
}
}
};