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

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 (info)
Dependencies base (==4.*), containers, mtl, STMonadTrans [details]
License BSD3
Author Patrick Bahr <paba@diku.dk>
Maintainer Patrick Bahr <paba@diku.dk>
Category Algorithms, Data
Uploaded Wed Jul 21 13:16:08 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, Stackage:0.3.2, Tumbleweed:0.3.2
Downloads 9675 total (295 in the last 30 days)
Votes
0 []
Status Docs not available [build log]
Last success reported on 2015-05-27 [all 7 reports]
Hackage Matrix CI

Modules

  • Data
    • Equivalence
      • Data.Equivalence.Monad
      • Data.Equivalence.STT

Downloads

Maintainer's Corner

For package maintainers and hackage trustees