MRUnionFind.cs File Reference

Classes
class	MR
class	MR.Const_UnionFind_MRVertId
	Union-find data structure for representing disjoint 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. Sequential implementation that selects the root of a united pair by set size for best performance. More...
struct	MR.Const_UnionFind_MRVertId._Underlying
class	MR.UnionFind_MRVertId
	Union-find data structure for representing disjoint 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. Sequential implementation that selects the root of a united pair by set size for best performance. More...
class	MR.Const_UnionFind_MRUndirectedEdgeId
	Union-find data structure for representing disjoint 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. Sequential implementation that selects the root of a united pair by set size for best performance. More...
struct	MR.Const_UnionFind_MRUndirectedEdgeId._Underlying
class	MR.UnionFind_MRUndirectedEdgeId
	Union-find data structure for representing disjoint 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. Sequential implementation that selects the root of a united pair by set size for best performance. More...
class	MR.Const_BaseUnionFind_MRFaceId
	base of union-find data structures: stores only the parent forest and the operations that depend on it alone, so it is shared by the sequential UnionFind and the ParallelUnionFind More...
class	MR.BaseUnionFind_MRFaceId
	base of union-find data structures: stores only the parent forest and the operations that depend on it alone, so it is shared by the sequential UnionFind and the ParallelUnionFind More...
class	MR.Const_BaseUnionFind_MRVertId
	base of union-find data structures: stores only the parent forest and the operations that depend on it alone, so it is shared by the sequential UnionFind and the ParallelUnionFind More...
class	MR.BaseUnionFind_MRVertId
	base of union-find data structures: stores only the parent forest and the operations that depend on it alone, so it is shared by the sequential UnionFind and the ParallelUnionFind More...
class	MR.Const_BaseUnionFind_MRUndirectedEdgeId
	base of union-find data structures: stores only the parent forest and the operations that depend on it alone, so it is shared by the sequential UnionFind and the ParallelUnionFind More...
class	MR.BaseUnionFind_MRUndirectedEdgeId
	base of union-find data structures: stores only the parent forest and the operations that depend on it alone, so it is shared by the sequential UnionFind and the ParallelUnionFind More...