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.


Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees


Versions [RSS] 0.1,,,
Dependencies array (>=0.3 && <0.6), base (>=4 && <5), 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 2021-07-22T13:36:20Z
Reverse Dependencies 3 direct, 1 indirect [details]
Downloads 3650 total (29 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2021-07-29 [all 1 reports]