MR.Const_UnionFind_MRUndirectedEdgeId 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_MRUndirectedEdgeId:

Classes
struct	_Underlying

Public Member Functions
virtual void	Dispose ()
unsafe	Const_UnionFind_MRUndirectedEdgeId ()
	Constructs an empty (default-constructed) instance.
unsafe	Const_UnionFind_MRUndirectedEdgeId (MR._ByValue_UnionFind_MRUndirectedEdgeId _other)
	Generated from constructor MR.UnionFind<MR.UndirectedEdgeId>::UnionFind.
unsafe	Const_UnionFind_MRUndirectedEdgeId (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.UndirectedEdgeId>::UnionFind.
unsafe ulong	size ()
	returns the number of elements in union-find Generated from method MR.UnionFind<MR.UndirectedEdgeId>::size.
unsafe bool	isRoot (MR.UndirectedEdgeId a)
	returns true if given element is the root of some set Generated from method MR.UnionFind<MR.UndirectedEdgeId>::isRoot.
unsafe MR.UndirectedEdgeId	parent (MR.UndirectedEdgeId a)
	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.
unsafe MR.Const_UndirectedEdgeMap	parents ()
	gets the parents of all elements as is Generated from method MR.UnionFind<MR.UndirectedEdgeId>::parents.

Protected Member Functions
virtual unsafe void	Dispose (bool disposing)

Additional Inherited Members
Protected Attributes inherited from MR.Misc.Object< Const_UnionFind_MRUndirectedEdgeId >
bool	_IsOwningVal
Properties inherited from MR.Misc.Object< Const_UnionFind_MRUndirectedEdgeId >
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

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

---

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

• MRUnionFind.cs