The disjoint-set package
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.
- No changelog available
|Dependencies||base (>=3 && <5), containers (>=0.3), mtl (>=2), transformers (>=0.3)|
|Author||Maxwell Sayles <firstname.lastname@example.org>|
|Maintainer||Maxwell Sayles <email@example.com>|
|Uploaded||Wed Oct 10 17:18:44 UTC 2012 by MaxwellSayles|
|Downloads||331 total (24 in last 30 days)|
|Status||Docs uploaded by user|
Build status unknown [no reports yet]
- disjoint-set-0.1.tar.gz [browse] (Cabal source package)
- Package description (included in the package)
For package maintainers and hackage trustees