Go to the source code of this file.
Classes | |
class | MR::UnionFind< I > |
Union-find data structure for representing disjoin sets of elements with few very quick operations: 1) union of two sets in one, 2) checking whether two elements pertain to the same set, 3) finding representative element (root) of each set by any set's element. More... | |
Namespaces | |
namespace | MR |