union-find-array: union find data structure

[ algorithms, data, library, mit ] [ Propose Tags ] [ Report a vulnerability ]

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.

Modules

[Index] [Quick Jump]

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

Downloads

union-find-array-0.1.0.4.tar.gz [browse] (Cabal source package)
Package description (revised from the package)

Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.

Maintainer's Corner

Package maintainers

BertramFelgenhauer, MartinAvanzini

For package maintainers and hackage trustees

edit package information

Candidates

0.1.0.3, 0.1.0.4

Versions [RSS]	0.1, 0.1.0.1, 0.1.0.2, 0.1.0.3, 0.1.0.4
Dependencies	array (>=0.3 && <0.6), base (>=4 && <5), mtl (>=1.1 && <2.4) [details]
License	MIT
Copyright	Copyright (c) 2010-2014, 2021, 2024, Bertram Felgenhauer
Author	Bertram Felgenhauer
Maintainer	Bertram Felgenhauer <int-e@gmx.de>
Revised	Revision 1 made by BertramFelgenhauer at 2024-04-30T10:44:19Z
Category	Algorithms, Data
Home page	https://github.com/haskell-rewriting/union-find-array
Source repo	head: git clone https://github.com/haskell-rewriting/union-find-array
Uploaded	by BertramFelgenhauer at 2024-04-29T13:21:20Z
Distributions	Stackage:0.1.0.4
Reverse Dependencies	3 direct, 1 indirect [details]
Downloads	3905 total (35 in the last 30 days)
Rating	(no votes yet) [estimated by Bayesian average]
Your Rating	λ λ λ
Status	Docs available [build log] Last success reported on 2024-04-29 [all 1 reports]