mrmeshpy.UnionFind_VertId Class Reference

Public Member Functions
None	__init__ (self)
None	__init__ (self, int size)
None	__init__ (self, UnionFind_VertId arg0)
VertId	find (self, VertId a)
VertId	findUpdateRange (self, VertId a, VertId begin, VertId end)
VertMap	parents (self)
None	reset (self, int size)
VertMap	roots (self)
int	size (self)
int	sizeOfComp (self, VertId a)
tuple[VertId, bool]	unite (self, VertId first, VertId second)
bool	united (self, VertId first, VertId second)

Detailed Description

Generated from:  MR::UnionFind<MR::VertId>


\\brief Simple union find data structure
\\tparam I is an id type, e.g. FaceId
\\ingroup BasicGroup

Constructor & Destructor Documentation

__init__() [1/3]

None mrmeshpy.UnionFind_VertId.__init__

(

self

)

__init__() [2/3]

None mrmeshpy.UnionFind_VertId.__init__	(		self,
		int	size )

__init__() [3/3]

None mrmeshpy.UnionFind_VertId.__init__	(		self,
		UnionFind_VertId	arg0 )

Implicit copy constructor.

Member Function Documentation

find()

VertId mrmeshpy.UnionFind_VertId.find	(		self,
		VertId	a )

finds the root of the set containing given element with optimizing data structure updates

findUpdateRange()

VertId mrmeshpy.UnionFind_VertId.findUpdateRange	(		self,
		VertId	a,
		VertId	begin,
		VertId	end )

finds the root of the set containing given element with optimizing data structure in the range [begin, end)

parents()

VertMap mrmeshpy.UnionFind_VertId.parents

(

self

)

gets the parents of all elements as in

reset()

None mrmeshpy.UnionFind_VertId.reset	(		self,
		int	size )

reset roots to represent each element as disjoint set of rank 0

roots()

VertMap mrmeshpy.UnionFind_VertId.roots

(

self

)

sets the root as the parent of each element, then returns the vector

size()

int mrmeshpy.UnionFind_VertId.size

(

self

)

sizeOfComp()

int mrmeshpy.UnionFind_VertId.sizeOfComp	(		self,
		VertId	a )

returns the size of component containing given element

unite()

tuple[VertId, bool] mrmeshpy.UnionFind_VertId.unite	(		self,
		VertId	first,
		VertId	second )

unite two elements,
\\return first: new common root, second: true = union was done, false = first and second were already united

united()

bool mrmeshpy.UnionFind_VertId.united	(		self,
		VertId	first,
		VertId	second )

returns true if given two elements are from one component

---

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

• mrmeshpy.pyi