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.
Properties
| Versions | 0.1, 0.2 |
|---|---|
| Dependencies | base (≥3 & <5), containers (≥0.3), mtl (≥2), transformers (≥0.3) |
| License | BSD3 |
| Author | Maxwell Sayles, Myles Maxfield |
| Maintainer | <maxwellsayles@gmail.com>, <myles.maxfield@gmail.com> |
| Stability | stable |
| Category | Data |
| Home page | https://github.com/maxwellsayles/disjoint-set |
| Source repository | git clone git://github.com/maxwellsayles/disjoint-set.git |
| Upload date | Mon Oct 15 16:21:59 UTC 2012 |
| Uploaded by | MaxwellSayles |
| Built on | ghc-7.6 |
Modules
Downloads
- disjoint-set-0.2.tar.gz (Cabal source package)
- package description (included in the package)