union-find-array: union find data structure

This is a package candidate release! Here you can preview how this package release will appear once published to the main package index (which can be accomplished via the 'maintain' link below). Please note that once a package has been published to the main package index it cannot be undone! Please consult the package uploading documentation for more information.

[maintain] [Publish]

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.

Properties

Versions 0.1, 0.1.0.1, 0.1.0.2, 0.1.0.3, 0.1.0.3, 0.1.0.4
Change log None available
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:34:28Z

Modules

[Index] [Quick Jump]

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees