package unionFind
Build not checkedInstall
dune-project
Dependency
Authors
Maintainers
Sources
md5=b92f29d7b920cf99651e0681aef1faf7
sha512=c4830c54269752706d90f29afe174a14c235b860c720ef3a873ca7672738e7f342d1dad381f7b1021a8d5f8a86f33774756dcf1fc23e0b4cfcbcb468e718a860
Description
Added to opam-repository:
README
The Union-Find Data Structure in Several Guises
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.
Installation
To install the latest released version, type opam install unionFind.
Documentation
Dev Dependencies
None
Optional Dependencies
None
Conflicts
None
Build status
Results of building unionFind with each compiler on check.ci.ocaml.org, run of against opam-repository 7cdc698. All results for this package.
Each result links to its build log. To keep crawlers from overloading the site, build logs require a GitHub sign-in (see ocurrent/opam-health-check). On your first log, GitHub asks you to “Authorize opam-health-check”, the OCurrent app that runs these checks; it sees only your public profile, not your repositories. The sign-in lasts 30 days.
This version is not in the latest run; the versions below are.
| Version | OCaml 4.11 | OCaml 4.14 | OCaml 5.2 | OCaml 5.4 | OCaml 5.5 |
|---|---|---|---|---|---|
| 20260226 | n/a | n/a | n/a | good | good |
| 20250818 | n/a | n/a | good | good | good |
| 20220122 | good | good | good | good | good |
- good Package successfully built
- partial One of the dependencies failed to build
- bad Package failed to build
- n/a Package is not available in this environment
- internal Internal failure