package unionFind
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
Maintainers
Sources
archive.tar.gz
md5=7238ac49fba7c730e90cf1a577207347
sha512=c49dd3f9a6689f6a5efe39c26efe2c137f8812b4be6ee76c2cc20068cf86ad73c0ac97ec9a543245dddb63792ce8c1904576b3435bf419cc7837bc5e368eee6d
Description
Published: 22 Jan 2022
README
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
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
On This Page