Skip to content

Latest commit

 

History

History
14 lines (11 loc) · 924 Bytes

README.md

File metadata and controls

14 lines (11 loc) · 924 Bytes

Hackage equivalence on Stackage Nightly Stackage LTS version Haskell CI

equivalence

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