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

Versions 0.1, 0.1.0.1, 0.1.0.2
Dependencies array (>=0.3 && <0.6), base (==4.*), mtl (>=1.1 && <2.3) [details]
License MIT
Copyright Copyright (c) 2010-2013, Bertram Felgenhauer
Author Bertram Felgenhauer
Maintainer Bertram Felgenhauer <int-e@gmx.de>
Stability experimental
Category Algorithms, Data
Home page https://github.com/haskell-rewriting/union-find-array
Source repository head: git clone git://github.com/haskell-rewriting/union-find-array
Uploaded Fri Apr 10 17:34:06 UTC 2015 by BertramFelgenhauer
Distributions NixOS:0.1.0.2
Downloads 837 total (19 in the last 30 days)
Votes
0 []
Status Docs available [build log]
Last success reported on 2015-04-10 [all 1 reports]

Modules

[Index]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees