PriorityQueuePriority, Value Methods |
The PriorityQueuePriority, Value generic type exposes the following members.
Name | Description | |
---|---|---|
Clear |
Removes all values and priorities from the que
| |
Insert |
Insert a value, append it to the arrays, then reheapify by promoting it to the correct place.
| |
Pop |
Get the value with the lowest priority creates a "hole" at the root of the tree. The algorithm swaps the hole with the appropriate child, until
the last entry will fit correctly into the hole (ie is lower priority than its children)
|