OdinAI
|
#include <PriorityQueue.h>
Public Member Functions | |
IndexedPriorityQLow (std::vector< T > &keys, int maxSize) | |
bool | Empty () const |
void | Insert (int index) |
int | Pop () |
void | ChangePriority (int index) |
Priority queue based on an index of keys. It prioritize the lowest value.
|
inline |
If the key have changed, update the priority queue accordingly.
|
inline |
Returns true if queue is empty.
|
inline |
Insert an element.
|
inline |
Returns the element with the lowest value.