MinPriorityQueue::compare

    (Available since version 1.0)

    MinPriorityQueue::compare — Compare elements in order to place them correctly in the heap

    Description

    protected int MinPriorityQueue::compare ( mixed $priority1 , mixed $priority2 )

    Compare priority1 with priority2.

    This method overrides PriorityQueue::compare() to produce a min-priority queue.

    Note:

    Multiple elements with the same priority will get dequeued in no particular order.

    Parameters

    priority1

    The priority of the first node being compared.

    priority2

    The priority of the second node being compared.

    Return Values

    Result of the comparison, positive integer if priority1 is less than priority2, 0 if they are equal, negative integer otherwise.

    See Also

    To Top