|
Data Structures Lerax
1.1.0
Opinionated Data Structures & Algorithms
|
A priority queue implementation using a binary heap. More...
#include <pqueue.h>
Data Fields | |
| PQueueNode * | heap |
| HashTable * | index |
| int | size |
| int | capacity |
| PQueueType | type |
A priority queue implementation using a binary heap.
| int PQueue::capacity |
the current capacity of PQueue
| PQueueNode* PQueue::heap |
inner heap for nodes
| HashTable* PQueue::index |
index of where keys are stored in heap
| int PQueue::size |
the current size of PQueue
| PQueueType PQueue::type |
type of the priority queue (min or max)