bheap
Binary_heap
Traditional implementation of priority queues using a binary heap encoded in a resizable array
module type Ordered = sig ... end
exception Empty
module Make (X : Ordered) : sig ... end