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
| Version | 0.1 |
|---|---|
| Dependencies | base (4.*) |
| 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 | Thu Aug 27 20:42:21 UTC 2009 |
| Uploaded by | ThomasSchilling |
| Built on | ghc-6.10, ghc-6.12, ghc-7.0 |
Modules
- Data
- UnionFind
Downloads
- union-find-0.1.tar.gz (Cabal source package)
- package description (included in the package)