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
To install the latest released version,
opam install unionFind.