Public Member Functions | |
None | __init__ (self) |
None | __init__ (self, int size) |
None | __init__ (self, UnionFind_FaceId arg0) |
FaceId | find (self, FaceId a) |
FaceId | findUpdateRange (self, FaceId a, FaceId begin, FaceId end) |
FaceMap | parents (self) |
None | reset (self, int size) |
FaceMap | roots (self) |
int | size (self) |
int | sizeOfComp (self, FaceId a) |
tuple[FaceId, bool] | unite (self, FaceId first, FaceId second) |
bool | united (self, FaceId first, FaceId second) |
Generated from: MR::UnionFind<MR::FaceId> \\brief Simple union find data structure \\tparam I is an id type, e.g. FaceId \\ingroup BasicGroup
None mrmeshpy.UnionFind_FaceId.__init__ | ( | self | ) |
None mrmeshpy.UnionFind_FaceId.__init__ | ( | self, | |
int | size ) |
None mrmeshpy.UnionFind_FaceId.__init__ | ( | self, | |
UnionFind_FaceId | arg0 ) |
Implicit copy constructor.
finds the root of the set containing given element with optimizing data structure updates
finds the root of the set containing given element with optimizing data structure in the range [begin, end)
FaceMap mrmeshpy.UnionFind_FaceId.parents | ( | self | ) |
gets the parents of all elements as in
None mrmeshpy.UnionFind_FaceId.reset | ( | self, | |
int | size ) |
reset roots to represent each element as disjoint set of rank 0
FaceMap mrmeshpy.UnionFind_FaceId.roots | ( | self | ) |
sets the root as the parent of each element, then returns the vector
int mrmeshpy.UnionFind_FaceId.size | ( | self | ) |
int mrmeshpy.UnionFind_FaceId.sizeOfComp | ( | self, | |
FaceId | a ) |
returns the size of component containing given element
unite two elements, \\return first: new common root, second: true = union was done, false = first and second were already united
returns true if given two elements are from one component