Class ADT.Priority_queue

Inheritance graph
ADT.Heap ADT.Priority_queue

This class implements a priority queue. Each element in the priority queue is assigned a priority value, and the priority queue always remains sorted in increasing order of the priority values. The top of the priority queue always holds the element with the smallest priority. The priority queue is realized as a (min-)heap.

Inherit Heap

inherit .Heap : Heap