Efficient union and equivalence testing of sets. http://github.com/nominolo/union-find

Version on this page:0.2
LTS Haskell 13.25:0.2
Stackage Nightly 2019-06-12:0.2
Latest on Hackage:0.2

See all snapshots union-find appears in

BSD-3-Clause licensed and maintained by Thomas Schilling

Module documentation for 0.2

There are no documented modules for this package.


A simple Haskell library that implements Tarjan’s Union/Find algorithm. Useful, for example, to implement unification in a type inference system.

The Union/Find algorithm implements these operations in (effectively) constant-time:

  1. Check whether two elements are in the same equivalence class.

  2. Create a union of two equivalence classes.

  3. Look up the descriptor of the equivalence class.


Using cabal (which comes with the Haskell Platform):

$ cabal install union-find

or in the checked-out repository:

$ cabal install
Depends on 3 packages:
Used by 3 packages:
comments powered byDisqus