union-find-array: union find data structure

[ algorithms, data, library, mit ] [ Propose Tags ]

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.

Versions [faq] 0.1,,
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>
Category Algorithms, Data
Home page https://github.com/haskell-rewriting/union-find-array
Source repo head: git clone git://github.com/haskell-rewriting/union-find-array
Uploaded by BertramFelgenhauer at 2015-04-10T17:34:06Z
Distributions NixOS:
Downloads 2648 total (33 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs available [build log]
Last success reported on 2015-04-10 [all 1 reports]




Maintainer's Corner

For package maintainers and hackage trustees