The union-find package

[Tags:bsd3, library]

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.


[Skip to Readme]

Properties

Versions 0.1, 0.2
Dependencies base (>=4.4 && <5), containers (>=0.3), transformers (>=0.2) [details]
License BSD3
Author Thomas Schilling <nominolo@googlemail.com>
Maintainer Thomas Schilling <nominolo@googlemail.com>
Stability provisional
Category Algorithms, Data
Home page http://github.com/nominolo/union-find
Bug tracker http://github.com/nominolo/union-find/issues
Source repository head: git clone git://github.com/nominolo/union-find
Uploaded Sat Jun 23 01:01:23 UTC 2012 by ThomasSchilling
Updated Sat May 28 14:02:41 UTC 2016 by phadej to revision 1
Distributions Fedora:0.2, LTSHaskell:0.2, NixOS:0.2, Stackage:0.2, Tumbleweed:0.2
Downloads 8844 total (12 in the last 30 days)
Votes
0 []
Status Docs uploaded by user
Build status unknown [no reports yet]

Modules

[Index]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees

Readme for union-find

Readme for union-find-0.2

union-find

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.

Installation

Using cabal (which comes with the Haskell Platform):

$ cabal install union-find

or in the checked-out repository:

$ cabal install