Maintaining an equivalence relation implemented as union-find using STT
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).
Release | Stable | Testing |
---|---|---|
Fedora Rawhide | 0.4.1-10.fc42 | - |
Fedora 42 | 0.4.1-10.fc42 | - |
Fedora 41 | 0.4.1-9.fc41 | - |
Fedora 40 | 0.4.1-6.fc40 | - |
Fedora EPEL 9 | 0.3.5-7.el9 | - |
Fedora EPEL 8 | 0.3.2-7.el8 | - |
You can contact the maintainers of this package via email at
ghc-equivalence dash maintainers at fedoraproject dot org
.