package unionFind
Implementations of the union-find data structure
Install
dune-project
Dependency
Authors
Maintainers
Sources
archive.tar.gz
md5=a0c130e7c7500fc183a9f8dbc5c7b8a8
sha512=a1f591a3de021c9ce952a15dab904b4ccc4fe36750ccc20a868f9a9630f68cffe694dcf9fc1dca5675fb09b320175eeb3799069b7a4dd05714a5d1bb64ee814e
Description
Published: 20 Aug 2025
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