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

Versions0.1, 0.2
Change logNone available
Dependenciesbase (==4.*), containers (>=0.3), transformers (>=0.2) [details]
LicenseBSD3
AuthorThomas Schilling <nominolo@googlemail.com>
MaintainerThomas Schilling <nominolo@googlemail.com>
Stabilityprovisional
CategoryAlgorithms, Data
Home pagehttp://github.com/nominolo/union-find
Bug trackerhttp://github.com/nominolo/union-find/issues
Source repositoryhead: git clone git://github.com/nominolo/union-find
UploadedSat Jun 23 01:01:23 UTC 2012 by ThomasSchilling
DistributionsFedora:0.2, LTSHaskell:0.2, NixOS:0.2, Stackage:0.2
Downloads8179 total (227 in last 30 days)
Votes
0 []
StatusDocs uploaded by user
Build status unknown [no reports yet]

Modules

[Index]

Downloads

Maintainers' corner

For package maintainers and hackage trustees

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