Portability | portable |
---|---|
Stability | experimental |
Maintainer | Luke Palmer <lrpalmer@gmail.com> |
Safe Haskell | Safe-Inferred |
Disjoint set data structure -- Partition a
maintains a collection of
disjoint sets of type a
, with the ability to find which set a particular
item belongs to and the ability to merge any two such sets into one.
Documentation
A Partition of a
: represents a collection of disjoint sets of a
whose
union includes every element of a
. Semantics: [[Partition a]] = P(P(a))
where P
is the power set operation.
A partition in which every element of a
is in its own set. Semantics:
[[discrete]] = { { x } | x in a }