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]

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.1.tar.gz [browse] (Cabal source package)
Package description (as included in the package)

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.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 2014-08-20T12:25:17Z
Distributions	LTSHaskell:0.1.0.4, Stackage:0.1.0.4
Reverse Dependencies	3 direct, 1 indirect [details]
Downloads	4016 total (4 in the last 30 days)
Rating	(no votes yet) [estimated by Bayesian average]
Your Rating	λ λ λ
Status	Docs available [build log] Successful builds reported [all 1 reports]