The union-find package
The Union/Find algorithm implements these operations in (effectively) constant-time:
1. Check whether two elements are in the same equivalence class.
2. Create a union of two equivalence classes.
3. Look up the descriptor of the equivalence class.
Properties
| Versions | 0.1, 0.2 |
|---|---|
| Dependencies | base (4.*), containers (≥0.3), transformers (≥0.2) |
| License | BSD3 |
| Author | Thomas Schilling <nominolo@googlemail.com> |
| Maintainer | Thomas Schilling <nominolo@googlemail.com> |
| Stability | provisional |
| Category | Algorithms, Data |
| Home page | http://github.com/nominolo/union-find |
| Bug tracker | http://github.com/nominolo/union-find/issues |
| Source repository | git clone git://github.com/nominolo/union-find |
| Upload date | Sat Jun 23 01:01:23 UTC 2012 |
| Uploaded by | ThomasSchilling |
| Built on | ghc-7.4 |
Modules
- Control
- Monad
- Data
Downloads
- union-find-0.2.tar.gz (Cabal source package)
- package description (included in the package)