The union-find-array package

[Tags: library, mit]

ST based implementation of Tarjan's disjoint set forests, using mutable arrays storing indices instead of references internally. There is also a pure, immutable version of the data structure, which is useful for querying the result of a union find construction.


Properties

Versions0.1, 0.1.0.1, 0.1.0.2
Dependenciesarray (>=0.3 && <0.6), base (==4.*), mtl (>=1.1 && <2.3)
LicenseMIT
CopyrightCopyright (c) 2010-2013, Bertram Felgenhauer
AuthorBertram Felgenhauer
MaintainerBertram Felgenhauer <int-e@gmx.de>
Stabilityexperimental
CategoryAlgorithms, Data
Home pagehttps://github.com/haskell-rewriting/union-find-array
Source repositoryhead: git clone git://github.com/haskell-rewriting/union-find-array
UploadedFri Apr 10 17:34:06 UTC 2015 by BertramFelgenhauer
DistributionsNixOS:0.1.0.2
Downloads471 total (40 in last 30 days)
StatusDocs available [build log]
Last success reported on 2015-04-10 [all 1 reports]

Modules

[Index]

Downloads

Maintainers' corner

For package maintainers and hackage trustees