OCaml implementations of the union-find data structure
Description
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.
Build Time
2024-02-29 15:54:43 GMT
Size
32.72 KB
b775917db0b0f9115975db9e424a9516
License
LGPL-2.1-or-later WITH OCaml-LGPL-linking-exception
