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
2025-01-11 20:14:59 GMT
Size
33.14 KB
88712f5598cc7d50fe8f88f028f777fb
License
LGPL-2.1-or-later WITH OCaml-LGPL-linking-exception
