union-find: Efficient union and equivalence testing of sets.
The Union/Find algorithm implements these operations in (effectively) constant-time:
Check whether two elements are in the same equivalence class.
Create a union of two equivalence classes.
Look up the descriptor of the equivalence class.
[Skip to Readme]
| Versions [faq] | 0.1, 0.2 |
|---|---|
| Dependencies | base (>=4.4 && <5), containers (>=0.3), transformers (>=0.2) [details] |
| License | BSD-3-Clause |
| Author | Thomas Schilling <nominolo@googlemail.com> |
| Maintainer | Thomas Schilling <nominolo@googlemail.com> |
| Revised | Revision 1 made by phadej at 2016-05-28T14:02:41Z |
| Category | Algorithms, Data |
| Home page | http://github.com/nominolo/union-find |
| Bug tracker | http://github.com/nominolo/union-find/issues |
| Source repo | head: git clone git://github.com/nominolo/union-find |
| Uploaded | by ThomasSchilling at 2012-06-23T01:01:23Z |
| Distributions | Fedora:0.2, LTSHaskell:0.2, NixOS:0.2, Stackage:0.2 |
| Downloads | 14157 total (19 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs uploaded by user Build status unknown [no reports yet] |
Downloads
- union-find-0.2.tar.gz [browse] (Cabal source package)
- Package description (revised from the package)
Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.