disjoint-set: Persistent disjoint-sets, a.k.a union-find.

[ bsd3, data, library ] [ Propose Tags ]

This is a persistent data structure for disjoint sets.

The algorithm is described in "Introduction to Algorithms" by Cormen, et al. The implementation here uses both union by rank and path compression. We incur an O(logn) overhead because of the use of persistent maps.

Data.IntDisjointSet is as strict as possible.

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

  • No Candidates
Versions [RSS] 0.1, 0.2
Dependencies base (>=3 && <5), containers (>=0.3), mtl (>=2), transformers (>=0.3) [details]
License LicenseRef-LGPL
Author Maxwell Sayles <maxwellsayles@gmail.com>
Maintainer Maxwell Sayles <maxwellsayles@gmail.com>
Category Data
Home page https://github.com/maxwellsayles/disjoint-set
Uploaded by MaxwellSayles at 2012-10-10T17:18:44Z
Distributions
Reverse Dependencies 1 direct, 0 indirect [details]
Downloads 2147 total (4 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]