union-find-array

union find data structure

https://github.com/haskell-rewriting/union-find-array

Stackage Nightly 2024-05-25:	0.1.0.4@rev:1
Latest on Hackage:	0.1.0.4@rev:1

See all snapshots union-find-array appears in

MIT licensed by Bertram Felgenhauer

Maintained by Bertram Felgenhauer

This version can be pinned in stack with:union-find-array-0.1.0.4@sha256:1522d9b8f34f16340455ca0b80c7ead2a54bf703329e2fddd9a3cae1ce9b3621,1445

Module documentation for 0.1.0.4

Control
- Control.Monad
  - Control.Monad.Union
    - Control.Monad.Union.Class
Data
- Data.Union
  - Data.Union.ST
  - Data.Union.Type

Depends on 3 packages(full list with versions):

array, base, mtl

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.