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
2023-12-30 19:20:21 GMT
Size
31.99 KB
20e762fc2a90f515c53f64510cd783c9
License
LGPL-2.1-or-later WITH OCaml-LGPL-linking-exception
