Package0.4.1.1AlgorithmsData
equivalence
Maintaining an equivalence relation implemented as union-find using STT.
- Version0.4.1.1
- CategoryAlgorithms, Data
- LicenceBSD-3-Clause
- AuthorPatrick Bahr
- MaintainerAndreas Abel
- Homepagegithub.com/pa-ba/equivalence
- Pinned byhackage equivalence 0.4.1.1
- Sourcehackage.haskell.org/package/equivalence-0.4.1.1
Modules
- Data.Equivalence.MonadThis is an alternative interface to the union-find implementation
- Data.Equivalence.STTThis is an implementation of Tarjan's Union-Find algorithm (Robert
Description
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).
Depends on
5 packages- STMonadTrans-0.4.8.1in this set
- base-4.23.0.0with GHC
- containers-0.8with GHC
- mtl-2.3.2with GHC
- transformers-0.6.3.0with GHC