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.4.1.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
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.md |
| Dependencies | base (>=4.8 && <5), containers, fail, mtl (>=2.2.1), STMonadTrans (>=0.4.3), transformers (>=0.2), transformers-compat (>=0.3) [details] |
| Tested with | ghc ==9.4.1, ghc ==9.2.3, ghc ==9.0.2, ghc ==8.10.7, ghc ==8.8.4, ghc ==8.6.5, ghc ==8.4.4, ghc ==8.2.2, ghc ==8.0.2, ghc ==7.10.3 |
| License | BSD-3-Clause |
| Author | Patrick Bahr |
| Maintainer | Andreas Abel |
| Category | Algorithms, Data |
| Home page | https://github.com/pa-ba/equivalence |
| Bug tracker | https://github.com/pa-ba/equivalence/issues |
| Source repo | head: git clone https://github.com/pa-ba/equivalence |
| Uploaded | by AndreasAbel at 2022-07-26T12:56:29Z |
| 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 | 38334 total (157 in the last 30 days) |
| Rating | 2.0 (votes: 1) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs available [build log] Last success reported on 2022-07-26 [all 1 reports] |