The union-find-array package

[ Tags: 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 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 <>
Category Algorithms, Data
Home page
Source repo head: git clone git://
Uploaded Fri Apr 10 17:34:06 UTC 2015 by BertramFelgenhauer
Distributions NixOS:
Downloads 1358 total (17 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2015-04-10 [all 1 reports]
Hackage Matrix CI




Maintainer's Corner

For package maintainers and hackage trustees