A union-find data structure for maintaining disjoint sets.
Checks if sets have no common values.
Lists all subsets of a set.
Removes a value from a set.
Split a set of valued intervals into disjoint intervals.
Disjoint-set forests for ES6
Compare two sets (array of items) and get relationships between them (Disjoint | Intersecting | Subset | Superset | Equal)