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 (7)

Authors

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

Maintainers

  1. F
    francois.pottier@inria.fr

Sources

archive.tar.gz
md5=b92f29d7b920cf99651e0681aef1faf7
sha512=c4830c54269752706d90f29afe174a14c235b860c720ef3a873ca7672738e7f342d1dad381f7b1021a8d5f8a86f33774756dcf1fc23e0b4cfcbcb468e718a860

doc/README.html

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

See the documentation of the latest released version.