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=d7cc5d5e1b2418b0e00053bc233b9454
sha512=8f99e5db73038faf5f0efb49079a653574e7291838eabbdfcb2887e6757bafce890cd3047e9d076bb1e2165463ad00ce38126c4570e158061ccfe3e1e54c0445
Description
Published: 01 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