A.19 library(heaps): heaps/priority queues
All Application Manual Name SummaryHelp

Availability::- use_module(library(heaps)).(can be autoloaded)
Source[semidet]min_of_heap(+Heap, ?Priority1, ?Key1, ?Priority2, ?Key2)
Gets the two minimum-priority elements from Heap. Complexity: logarithmic (amortized).

Do not use this predicate; it exists for compatibility with earlier implementations of this library and the SICStus counterpart. It performs a linear amount of work in the worst case that a following get_from_heap has to re-do.