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-07-25 08:14:54 GMT
Size
32.91 KB
5bca3624c05081a98a0fe70a4319b6fe
License
LGPL-2.1-or-later WITH OCaml-LGPL-linking-exception
