bheapversion Documentation on ocaml.org
Priority queues
Traditional implementation using a binary heap encoded in a resizable array
| Author | Jean-Christophe Filliâtre |
|---|---|
| License | LGPL-2.1-only |
| Published | |
| Homepage | https://github.com/backtracking/bheap |
| Issue Tracker | https://github.com/backtracking/bheap/issues |
| Maintainer | Jean-Christophe.Filliatre@lri.fr |
| Dependencies |
|
| Source [http] | https://github.com/backtracking/bheap/releases/download/2.0.0/bheap-2.0.0.tbz sha256=5f43d7b237bc87b07097f60eae2b32de64e644158308da338bf1512014bdf636 sha512=90dcf2b3856b25f8ec7204d3596b64dfc264e9158ea84e8c2f15e3980c45ef888b7a969e613f31a626aebc4c5963a09b4fd3c3b95beba7d3159ff42080193841 |
| Edit | https://github.com/ocaml/opam-repository/tree/master/packages/bheap/bheap.2.0.0/opam |
Required by
