Union-find data structure for representing disjoint 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. Sequential implementation that selects the root of a united pair by set size for best performance.
More...
|
| virtual unsafe void | Dispose (bool disposing) |
Union-find data structure for representing disjoint 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. Sequential implementation that selects the root of a united pair by set size for best performance.
- Template Parameters
-
| I | is the identifier of a set's element, e.g. FaceId Generated from class MR::UnionFind<MR.UndirectedEdgeId>. Base classes: Direct: (non-virtual) MR::BaseUnionFind<MR.UndirectedEdgeId> This is the const half of the class. |
◆ Const_UnionFind_MRUndirectedEdgeId() [1/6]
| unsafe MR.Const_UnionFind_MRUndirectedEdgeId.Const_UnionFind_MRUndirectedEdgeId |
( |
| ) |
|
|
inline |
Constructs an empty (default-constructed) instance.
◆ Const_UnionFind_MRUndirectedEdgeId() [2/6]
| unsafe MR.Const_UnionFind_MRUndirectedEdgeId.Const_UnionFind_MRUndirectedEdgeId |
( |
MR._ByValue_UnionFind_MRUndirectedEdgeId | _other | ) |
|
|
inline |
◆ Const_UnionFind_MRUndirectedEdgeId() [3/6]
◆ Const_UnionFind_MRUndirectedEdgeId() [4/6]
◆ Const_UnionFind_MRUndirectedEdgeId() [5/6]
| unsafe MR.Const_UnionFind_MRUndirectedEdgeId.Const_UnionFind_MRUndirectedEdgeId |
( |
nuint | size | ) |
|
|
inline |
creates union-find with given number of elements, each element is the only one in its disjoint set Generated from constructor MR::UnionFind<MR.UndirectedEdgeId>::UnionFind.
◆ Const_UnionFind_MRUndirectedEdgeId() [6/6]
adopts the parent forest of a base/parallel union-find and (re)computes set sizes, so the result supports the full sequential interface (e.g. unite, sizeOfComp) Generated from constructor MR::UnionFind<MR.UndirectedEdgeId>::UnionFind.
◆ Dispose() [1/2]
| virtual void MR.Const_UnionFind_MRUndirectedEdgeId.Dispose |
( |
| ) |
|
|
inlinevirtual |
◆ Dispose() [2/2]
| virtual unsafe void MR.Const_UnionFind_MRUndirectedEdgeId.Dispose |
( |
bool | disposing | ) |
|
|
inlineprotectedvirtual |
◆ isRoot()
◆ operator MR.Const_BaseUnionFind_MRUndirectedEdgeId()
◆ parent()
return parent element of this element, which is equal to given element only for set's root Generated from method MR::UnionFind<MR.UndirectedEdgeId>parent.
◆ parents()
◆ size()
| unsafe nuint MR.Const_UnionFind_MRUndirectedEdgeId.size |
( |
| ) |
|
|
inline |
The documentation for this class was generated from the following file: