30 #ifndef PAL_PRIORITYQUEUE_H 31 #define PAL_PRIORITYQUEUE_H 38 #define LEFT(x) (2*x+1) 39 #define RIGHT(x) (2*x+2) 40 #define PARENT(x) ((x-1)/2) 79 void remove(
int key );
80 void insert(
int key,
double p );
101 bool ( *greater )(
double l,
double r );
PriorityQueue & operator=(const PriorityQueue &)=delete
PriorityQueue cannot be copied.
void insert(int key, double p)
void setPriority(int key, double new_p)
PriorityQueue(int n, int maxId, bool min)
Create a priority queue of max size n \param n max size of the queuet \param p external vector repres...
void decreaseKey(int key)