The disjoint-set package

[Tags: bsd3, library]

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.


Properties

Versions0.1, 0.2
Dependenciesbase (>=3 && <5), containers (>=0.3), mtl (>=2), transformers (>=0.3)
LicenseLGPL
AuthorMaxwell Sayles <maxwellsayles@gmail.com>
MaintainerMaxwell Sayles <maxwellsayles@gmail.com>
Stabilitystable
CategoryData
Home pagehttps://github.com/maxwellsayles/disjoint-set
UploadedWed Oct 10 17:18:44 UTC 2012 by MaxwellSayles
Downloads276 total (14 in last 30 days)
StatusDocs uploaded by user
Build status unknown [no reports yet]

Modules

[Index]

Downloads

Maintainers' corner

For package maintainers and hackage trustees