MeshLib C# Docs
Loading...
Searching...
No Matches
MR.Const_UnionFind_MRVertId Class Reference

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...

+ Inheritance diagram for MR.Const_UnionFind_MRVertId:

Classes

struct  _Underlying
 

Public Member Functions

virtual void Dispose ()
 
unsafe Const_UnionFind_MRVertId ()
 Constructs an empty (default-constructed) instance.
 
unsafe Const_UnionFind_MRVertId (MR._ByValue_UnionFind_MRVertId _other)
 Generated from constructor MR.UnionFind<MR.VertId>::UnionFind.
 
unsafe Const_UnionFind_MRVertId (ulong size)
 creates union-find with given number of elements, each element is the only one in its disjoint set Generated from constructor MR.UnionFind<MR.VertId>::UnionFind.
 
unsafe ulong size ()
 returns the number of elements in union-find Generated from method MR.UnionFind<MR.VertId>::size.
 
unsafe bool isRoot (MR.VertId a)
 returns true if given element is the root of some set Generated from method MR.UnionFind<MR.VertId>::isRoot.
 
unsafe MR.VertId parent (MR.VertId a)
 return parent element of this element, which is equal to given element only for set's root Generated from method MR.UnionFind<MR.VertId>::parent.
 
unsafe MR.Const_VertMap parents ()
 gets the parents of all elements as is Generated from method MR.UnionFind<MR.VertId>::parents.
 

Protected Member Functions

virtual unsafe void Dispose (bool disposing)
 

Additional Inherited Members

- Protected Attributes inherited from MR.Misc.Object< Const_UnionFind_MRVertId >
bool _IsOwningVal
 
- Properties inherited from MR.Misc.Object< Const_UnionFind_MRVertId >
virtual bool _IsOwning [get]
 Returns true if this is an owning instance, and when disposed, will destroy the underlying C++ instance. If false, we assume that the underlying C++ instance will live long enough.
 

Detailed Description

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.

Template Parameters
Iis the identifier of a set's element, e.g. FaceId Generated from class MR.UnionFind<MR.VertId>. This is the const half of the class.

The documentation for this class was generated from the following file: