Namespace MoreStructures.DisjointSets

Classes

PathCompressionWeightedQuickUnionDisjointSet

A WeightedQuickUnionDisjointSet refinement which improves the performance of the data structure by performing a technique known as path compression.

QuickFindDisjointSet

An IDisjointSet implementation based on a simple to store set ids of each of the values stored in the Disjoint Set.

QuickUnionDisjointSet

An IDisjointSet implementation based on a simple conceptually storing a forest of trees, by defining the index of the parent node, for each value stored in the data structure.

WeightedQuickUnionDisjointSet

A QuickUnionDisjointSet refinement which improves the performance of Find by minimizing the height of trees in the forest when merging them in Union(Int32, Int32).

Interfaces

A data structure modelling a collection of sets of non-negative consecutive integer values 0..k-1, where set can be easily merged together and values can be easily checked for membership to the same set.