priority queue implementation
C33132
concept
A priority queue implementation is a data structure that stores elements with associated priorities and allows efficient retrieval and removal of the element with the highest (or lowest) priority.
Observed surface forms (2)
| Surface form | Occurrences |
|---|---|
| comparison-based priority queue | 1 |
| self-adjusting heap | 1 |
Instances (2)
| Instance | Via concept surface |
|---|---|
|
pairing heap (as a practical alternative)
surface form:
pairing heap
|
— |
| Fibonacci heap | — |