A.19 library(heaps): heaps/priority queues
AllApplicationManualNameSummaryHelp

  • Documentation
    • Reference manual
      • The SWI-Prolog library
        • library(heaps): heaps/priority queues
          • add_to_heap/4
          • delete_from_heap/4
          • empty_heap/1
          • singleton_heap/3
          • get_from_heap/4
          • heap_size/2
          • heap_to_list/2
          • is_heap/1
          • list_to_heap/2
          • min_of_heap/3
          • min_of_heap/5
          • merge_heaps/3
    • Packages
Availability::- use_module(library(heaps)).(can be autoloaded)
Source[semidet]get_from_heap(?Heap0, ?Priority, ?Key, -Heap)
Retrieves the minimum-priority pair Priority-Key from Heap0. Heap is Heap0 with that pair removed. Complexity: logarithmic (amortized), linear in the worst case.