unionFind

Implementations of the union-find data structure
README

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
.

Install
Sources
archive.tar.gz
md5=7238ac49fba7c730e90cf1a577207347
sha512=c49dd3f9a6689f6a5efe39c26efe2c137f8812b4be6ee76c2cc20068cf86ad73c0ac97ec9a543245dddb63792ce8c1904576b3435bf419cc7837bc5e368eee6d
Dependencies
dune
>= "1.4"
ocaml
>= "4.05"
Reverse Dependencies
inferno
>= "20220603"