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.
	Const_UnionFind_MRUndirectedEdgeId (Const_UnionFind_MRUndirectedEdgeId _other)
	Generated from constructor MR::UnionFind<MR.UndirectedEdgeId>::UnionFind.
	Const_UnionFind_MRUndirectedEdgeId (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)

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.

Constructor & Destructor Documentation

Const_UnionFind_MRUndirectedEdgeId() [1/5]

unsafe MR.Const_UnionFind_MRUndirectedEdgeId.Const_UnionFind_MRUndirectedEdgeId ( )

inline

Constructs an empty (default-constructed) instance.

Const_UnionFind_MRUndirectedEdgeId() [2/5]

unsafe MR.Const_UnionFind_MRUndirectedEdgeId.Const_UnionFind_MRUndirectedEdgeId ( MR._ByValue_UnionFind_MRUndirectedEdgeId _other )

inline

Generated from constructor MR::UnionFind<MR.UndirectedEdgeId>::UnionFind.

Const_UnionFind_MRUndirectedEdgeId() [3/5]

MR.Const_UnionFind_MRUndirectedEdgeId.Const_UnionFind_MRUndirectedEdgeId ( Const_UnionFind_MRUndirectedEdgeId _other )

inline

Generated from constructor MR::UnionFind<MR.UndirectedEdgeId>::UnionFind.

Const_UnionFind_MRUndirectedEdgeId() [4/5]

MR.Const_UnionFind_MRUndirectedEdgeId.Const_UnionFind_MRUndirectedEdgeId ( UnionFind_MRUndirectedEdgeId _other )

inline

Generated from constructor MR::UnionFind<MR.UndirectedEdgeId>::UnionFind.

Const_UnionFind_MRUndirectedEdgeId() [5/5]

unsafe MR.Const_UnionFind_MRUndirectedEdgeId.Const_UnionFind_MRUndirectedEdgeId ( ulong 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.

Member Function Documentation

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()

unsafe bool MR.Const_UnionFind_MRUndirectedEdgeId.isRoot ( MR.UndirectedEdgeId a )

inline

returns true if given element is the root of some set Generated from method MR::UnionFind<MR.UndirectedEdgeId>isRoot.

parent()

unsafe MR.UndirectedEdgeId MR.Const_UnionFind_MRUndirectedEdgeId.parent ( MR.UndirectedEdgeId a )

inline

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()

unsafe MR.Const_UndirectedEdgeMap MR.Const_UnionFind_MRUndirectedEdgeId.parents ( )

inline

gets the parents of all elements as is Generated from method MR::UnionFind<MR.UndirectedEdgeId>parents.

size()

unsafe ulong MR.Const_UnionFind_MRUndirectedEdgeId.size ( )

inline

returns the number of elements in union-find Generated from method MR::UnionFind<MR.UndirectedEdgeId>size.

---

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

• MRUnionFind.cs