OCaml binary heap implementation by Jean-Christophe Filliatre
Browse cluster: OCaml Systems and Utilities →bheap is an OCaml implementation of priority queues using a traditional binary heap data structure encoded in a resizable array. The project was created by Jean-Christophe Filliatre and provides a straightforward approach to managing priority queue operations through an array-based heap representation.