equivalence: Maintaining an equivalence relation implemented as union-find using STT.
This is a package candidate release! Here you can preview how this package release will appear once published to the main package index (which can be accomplished via the 'maintain' link below). Please note that once a package has been published to the main package index it cannot be undone! Please consult the package uploading documentation for more information.
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).
Properties
| Versions | 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, 0.4.1 |
|---|---|
| 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] |
| 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:35:47Z |
Modules
[Index] [Quick Jump]
- Data
- Equivalence
Downloads
- equivalence-0.4.1.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
Package maintainers
For package maintainers and hackage trustees