The equivalence package

[Tags:bsd3, library, test]

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


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.1, 0.3.2 (info)
Dependencies base (==4.*), containers, mtl, QuickCheck (>=2), STMonadTrans, template-haskell, test-framework, test-framework-quickcheck2 [details]
License BSD3
Author Patrick Bahr <>
Maintainer Patrick Bahr <>
Stability provisional
Category Algorithms, Data
Uploaded Tue Oct 5 11:15:45 UTC 2010 by PatrickBahr
Distributions Arch:0.3.2, Debian:0.3.1, Fedora:0.3.2, FreeBSD:0.3.1, LTSHaskell:0.3.2, NixOS:0.3.2, Tumbleweed:0.3.2
Downloads 8730 total (70 in the last 30 days)
0 []
Status Docs uploaded by user
Build status unknown [no reports yet]




testBuild test executable.DisabledAutomatic

Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info


Maintainer's Corner

For package maintainers and hackage trustees