Maintaining an equivalence relation implemented as union-find using STT. https://github.com/pa-ba/equivalence

Version on this page:0.3.3
LTS Haskell 12.26:0.3.3
Stackage Nightly 2018-09-28:0.3.3
Latest on Hackage:0.3.3

See all snapshots equivalence appears in

BSD-3-Clause licensed by Patrick Bahr
Maintained by paba@itu.dk

Module documentation for 0.3.3

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')
Used by 1 package:
comments powered byDisqus