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 LGPL
Author Maxwell Sayles <>
Maintainer Maxwell Sayles <>
Category Data
Home page
Uploaded Wed Oct 10 17:18:44 UTC 2012 by MaxwellSayles
Distributions NixOS:0.2
Downloads 652 total (9 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