(Available since version 1.0)
This class provides the main functionalities of a prioritized queue, implemented using a pairing, min-heap.
It provides the same interface as SplPriorityQueue with the extra method, PriorityQueue::update() which allows one to change the priority of a node in the queue.