Maintaining an equivalence relation implemented as union-find using STT
26.65 KB
built 2026-10-14 00:38:15 GMT
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).
Dependencies
12 totalRequires10
- ghc-Cabal-devel
- ghc-QuickCheck-devel
- ghc-STMonadTrans-devel
- ghc-base-devel
- ghc-containers-devel
- ghc-mtl-devel
- ghc-rpm-macros
- ghc-transformers-devel
- rpmlib(CompressedFileNames) <= 3.0.4-1
- rpmlib(FileDigests) <= 4.6.0-1
Provides2
- ghc-equivalence = 0.4.1.1-2.fc45
- ghc-equivalence-devel = 0.4.1.1-2.fc45
ObsoletesNo Obsoletes
ConflictsNo Conflicts
RecommendsNo Recommends
SuggestsNo Suggests
SupplementsNo Supplements
EnhancesNo Enhances
Files
2Name  |
Size |
|---|---|
| equivalence-0.4.1.1.tar.gz | 9.14 KB |
| ghc-equivalence.spec | 8.66 KB |
Files 1–2 of 2
Component of
buildroots that installed this RPMNo Buildroots