The disjoint-set package

[Tags:bsd3, library, test]

This is a persistent data structure for disjoint sets.

The algorithm is described in Introduction to Algorithms by Cormen, et al. The implementation here uses both union by rank and path compression. We incur an O(logn) overhead because of the use of persistent maps.

Data.IntDisjointSet is as strict as possible.


Versions 0.1, 0.2
Dependencies base (>=3 && <5), containers (>=0.3), mtl (>=2), transformers (>=0.3) [details]
License BSD3
Author Maxwell Sayles, Myles Maxfield
Maintainer <>, <>
Stability stable
Category Data
Home page
Source repository head: git clone git://
Uploaded Mon Oct 15 16:21:59 UTC 2012 by MaxwellSayles
Distributions NixOS:0.2
Downloads 608 total (8 in the last 30 days)
0 []
Status Docs uploaded by user
Build status unknown [no reports yet]




Maintainer's Corner

For package maintainers and hackage trustees