package unionFind

  1. Overview
  2. Docs
Implementations of the union-find data structure

Install 

dune-project
 Dependency

gitlab.inria.fr Readme Changelog Edit opam file Versions (8)

Authors

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

Maintainers

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

Sources

archive.tar.gz
md5=7e57c20b67da45a7b9f3eca5451ba1a2
sha512=ffbdf67b9a72ee6166846387aecf4334837aae21354d13d4eca8766ae18ca3614e562a4fd45f3e8fb31e23bb913efd5ad4bec1478b590d4394f491f33a7e9236

Description

Published: 27 Feb 2026

README

The Union-Find Data Structure in Several Guises

The OCaml library unionFind offers several implementations of the union-find data structure. All implementations are based on disjoint sets forests, with path compression and a balanced-linking policy, 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.

Dependencies (3)

  1. store >= "0.1"
  2. ocaml >= "5.4.0"
  3. dune >= "3.11"

Dev Dependencies (3)

  1. odoc with-doc
  2. ocamlfind with-test
  3. monolith with-test & >= "20241126"

Used by (4)

  1. binsec >= "0.11.0"
  2. catala < "1.0.0~beta"
  3. frama-c >= "28.0~beta"
  4. inferno >= "20220603"

Conflicts

None