package unionFind

You can search for identifiers within the package.

in-package search v0.2.0

Implementations of the union-find data structure

Install

Dune Dependency

gitlab.inria.fr Readme Changelog LGPL-2.0-only WITH OCaml-LGPL-linking-exception License Edit opam file Versions (6)

Authors

F

François Pottier <francois.pottier@inria.fr>

Maintainers

F

francois.pottier@inria.fr

Sources

archive.tar.gz

md5=73e94e8ad901ac52624ed9a910520a79

sha512=ab33c508632ef024a7974af428c737f1b0654d074f302615d395382b756c080d15b8903828bbe987de218c8ea2ab01c4c665b2c6c7512cb1c273e3bbf44307bf

README.md.html

The Union-Find Data Structure in Several Guises

The OCaml library unionFind offers two implementations of the union-find data structure. Both implementations are based on disjoint sets forests, with path compression and linking-by-rank, so as to guarantee good asymptotic complexity: every operation requires a quasi-constant number of accesses to the store.

Installation

To install the latest released version, type opam install unionFind.

Documentation

See the documentation of the latest released version.