equivalence: Maintaining an equivalence relation implemented as union-find using STT.

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

Versions [faq] 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, 0.3.3 (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 BSD-3-Clause
Author Patrick Bahr
Maintainer paba@itu.dk
Category Algorithms, Data
Home page https://github.com/pa-ba/equivalence
Bug tracker https://github.com/pa-ba/equivalence/issues/new
Source repo head: git clone https://github.com/pa-ba/equivalence
Uploaded by PatrickBahr at Sun Sep 23 09:26:19 UTC 2018
Distributions Arch:0.3.3, Debian:0.3.2, Fedora:0.3.2, FreeBSD:0.3.1, NixOS:0.3.3
Downloads 17876 total (301 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs available [build log]
Last success reported on 2018-09-23 [all 1 reports]

Modules

[Index] [Quick Jump]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees