union-find: Efficient union and equivalence testing of sets.

[ algorithms, bsd3, data, library ] [ Propose Tags ]

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]




Maintainer's Corner

For package maintainers and hackage trustees


  • No Candidates
Versions [RSS] 0.1, 0.2
Dependencies base (>=4 && <5) [details]
License BSD-3-Clause
Author Thomas Schilling <nominolo@googlemail.com>
Maintainer Thomas Schilling <nominolo@googlemail.com>
Category Algorithms, Data
Home page http://github.com/nominolo/union-find
Bug tracker http://github.com/nominolo/union-find/issues
Source repo head: git clone git://github.com/nominolo/union-find
Uploaded by ThomasSchilling at 2009-08-27T20:42:21Z
Distributions Fedora:0.2, LTSHaskell:0.2, NixOS:0.2
Downloads 14793 total (23 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]

Readme for union-find-0.1

[back to package description]