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
|
/*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software Foundation,
* Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*/
#pragma once
/** \file
* \ingroup bli
*
* This implements the disjoint set data structure with path compression and union by rank.
*/
#include "BLI_array.hh"
namespace blender {
class DisjointSet {
private:
Array<int64_t> parents_;
Array<int64_t> ranks_;
public:
/**
* Create a new disjoint set with the given size. Initially, every element is in a separate set.
*/
DisjointSet(int64_t size) : parents_(size), ranks_(size, 0)
{
BLI_assert(size >= 0);
for (int64_t i = 0; i < size; i++) {
parents_[i] = i;
}
}
/**
* Join the sets containing elements x and y. Nothing happens when they have been in the same set
* before.
*/
void join(int64_t x, int64_t y)
{
int64_t root1 = this->find_root(x);
int64_t root2 = this->find_root(y);
/* x and y are in the same set already. */
if (root1 == root2) {
return;
}
/* Implement union by rank heuristic. */
if (ranks_[root1] < ranks_[root2]) {
std::swap(root1, root2);
}
parents_[root2] = root1;
if (ranks_[root1] == ranks_[root2]) {
ranks_[root1]++;
}
}
/**
* Return true when x and y are in the same set.
*/
bool in_same_set(int64_t x, int64_t y)
{
int64_t root1 = this->find_root(x);
int64_t root2 = this->find_root(y);
return root1 == root2;
}
/**
* Find the element that represents the set containing x currently.
*/
int64_t find_root(int64_t x)
{
/* Find root by following parents. */
int64_t root = x;
while (parents_[root] != root) {
root = parents_[root];
}
/* Compress path. */
while (parents_[x] != root) {
int64_t parent = parents_[x];
parents_[x] = root;
x = parent;
}
return root;
}
};
} // namespace blender
|
