OCaml implementations of the union-find data structure
54.62 KB
built 2026-10-16 13:12:20 GMT
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.
Dependencies
7 totalRequires5
- ocaml >= 5.4.0
- ocaml-dune >= 3.11
- ocaml-store-devel >= 0.1
- rpmlib(CompressedFileNames) <= 3.0.4-1
- rpmlib(FileDigests) <= 4.6.0-1
Provides2
- ocaml-unionfind = 20260226-4.fc45
- ocaml-unionfind-devel = 20260226-4.fc45
ObsoletesNo Obsoletes
ConflictsNo Conflicts
RecommendsNo Recommends
SuggestsNo Suggests
SupplementsNo Supplements
EnhancesNo Enhances
Files
2Name ![]() |
Size |
|---|---|
| ocaml-unionfind.spec | 4.19 KB |
| unionfind-20260226.tar.bz2 | 40.33 KB |
Files 1–2 of 2
Component of
buildroots that installed this RPMNo Buildroots
