Maintaining an equivalence relation implemented as union-find using STT.


Version on this page:0.3.2@rev:1
LTS Haskell 22.25:0.4.1
Stackage Nightly 2024-06-16:0.4.1
Latest on Hackage:0.4.1

See all snapshots equivalence appears in

BSD-3-Clause licensed by Patrick Bahr
Maintained by [email protected]
This version can be pinned in stack with:equivalence-0.3.2@sha256:c83ef0092c45011e4d58091d0d90fdd068ef8e04dddaf69e8df66631ef031604,1683

Module documentation for 0.3.2

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).


* add Applicative constraints for backwards compatibility with GHC 7.8

* use transformers-compat for backwards compatibility with older versions of transformers
* add CHANGES.txt to .cabal file

* add suport for Control.Monad.Except (thus the new dependency constraint 'mtl >= 2.2.1')