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

Version0.1
Dependenciesarray (>=0.3 && <0.5), base (==4.*), mtl (>=1.1 && <2.2)
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
Upload dateWed Jun 5 10:31:45 UTC 2013
Uploaded byBertramFelgenhauer
Downloads101 total (16 in last 30 days)

Modules

Downloads

Maintainers' corner

For package maintainers and hackage trustees