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]|
|Author||Thomas Schilling <firstname.lastname@example.org>|
|Maintainer||Thomas Schilling <email@example.com>|
|Revised||Revision 1 made by phadej at Sat May 28 14:02:41 UTC 2016|
|Source repo||head: git clone git://github.com/nominolo/union-find|
|Uploaded||by ThomasSchilling at Sat Jun 23 01:01:23 UTC 2012|
|Distributions||Fedora:0.2, LTSHaskell:0.2, NixOS:0.2, Stackage:0.2|
|Downloads||12753 total (72 in the last 30 days)|
|Rating||(no votes yet) [estimated by rule of succession]|
Docs uploaded by user
Build status unknown [no reports yet]
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'.
For package maintainers and hackage trustees