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).
Changes
0.3.5 ----- * compatibility with GHC 8.8
0.3.4 ----- * MonadFail instance for EquivT
0.3.3 ----- * compatibility with GHC 8.6
0.3.2 ----- * add Applicative constraints for backwards compatibility with GHC 7.8
0.3.1 ----- * use transformers-compat for backwards compatibility with older versions of transformers
0.3.0.1 ------- * add CHANGES.txt to .cabal file
0.3 --- * add suport for Control.Monad.Except (thus the new dependency constraint 'mtl >= 2.2.1')
