The equivalence package

[ Tags: algorithms, bsd3, data, library ] [ Propose Tags ]

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)
Change log CHANGES.txt
Dependencies base (==4.*), containers, mtl (>=2.0.1), STMonadTrans (>=0.4.3), transformers (>=0.2), transformers-compat (>=0.3) [details]
License BSD3
Author Patrick Bahr
Maintainer paba@di.ku.dk
Category Algorithms, Data
Home page https://github.com/pa-ba/equivalence
Bug tracker https://github.com/pa-ba/equivalence/issues/new
Source repository head: git clone https://github.com/pa-ba/equivalence
Uploaded Tue Feb 7 12:18:08 UTC 2017 by PatrickBahr
Updated Mon Feb 13 12:20:16 UTC 2017 by PatrickBahr to revision 1
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 11572 total (263 in the last 30 days)
Rating 0.0 (0 ratings) [clear rating]
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2017-02-07 [all 1 reports]
Hackage Matrix CI

Modules

[Index]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees