ocaml-unionfind
OCaml implementations of the union-find data structure
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.
Releases Overview
| Release | Stable | Testing |
|---|---|---|
| Fedora Rawhide | 20220122-4.fc40 | - |
| Fedora 40 | 20220122-4.fc40 | - |
| Fedora 39 | 20220122-2.fc39 | - |
File a new bug report »
Package Info
Related Packages
Package Info
- Upstream: https://gitlab.inria.fr/fpottier/unionfind
- License(s): LGPL-2.1-or-later WITH OCaml-LGPL-linking-exception
- Maintainer: jjames
Related Packages
You can contact the maintainers of this package via email at
ocaml-unionfind dash maintainers at fedoraproject dot org.
Sources on Pagure