equivalence: Maintaining an equivalence relation implemented as union-find using STT.
This is an implementation of Tarjan's Union-Find algorithm (Robert E. Tarjan. "Efficiency of a Good But Not Linear Set Union Algorithm", JACM 22(2), 1975) in order to maintain an equivalence relation. This implementation is a port of the union-find package using the ST monad transformer (instead of the IO monad).
Downloads
- equivalence-0.3.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'.
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
| Versions [RSS] | 0.1, 0.1.1, 0.2.0, 0.2.1, 0.2.2, 0.2.3, 0.2.4, 0.2.5, 0.2.6, 0.3, 0.3.0.1, 0.3.1, 0.3.2, 0.3.3, 0.3.4, 0.3.5, 0.4, 0.4.0.1, 0.4.1 (info) |
|---|---|
| Change log | CHANGES.txt |
| Dependencies | base (>=4 && <4.12), containers, mtl (>=2.2.1 && <2.3), STMonadTrans (>=0.4.3), transformers (>=0.2 && <0.6), transformers-compat (>=0.3) [details] |
| License | BSD-3-Clause |
| Author | Patrick Bahr |
| Maintainer | paba@di.ku.dk |
| Revised | Revision 2 made by AndreasAbel at 2022-02-01T19:09:44Z |
| Category | Algorithms, Data |
| Home page | https://github.com/pa-ba/equivalence |
| Bug tracker | https://github.com/pa-ba/equivalence/issues/new |
| Source repo | head: git clone https://github.com/pa-ba/equivalence |
| Uploaded | by PatrickBahr at 2017-02-07T12:18:08Z |
| Distributions | Arch:0.4.1, Debian:0.3.5, Fedora:0.4.1, FreeBSD:0.3.1, LTSHaskell:0.4.1, NixOS:0.4.1, Stackage:0.4.1 |
| Reverse Dependencies | 3 direct, 9 indirect [details] |
| Downloads | 37067 total (168 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs available [build log] Last success reported on 2017-02-07 [all 1 reports] |