30 #ifndef _PRIORITYQUEUE_H
31 #define _PRIORITYQUEUE_H
35 #define LEFT(x) (2*x+1)
36 #define RIGHT(x) (2*x+2)
37 #define PARENT(x) ((x-1)/2)
64 void remove(
int key );
65 void insert(
int key,
double p );
88 bool ( *greater )(
double l,
double r );
void setPriority(int key, double new_p)
void insert(int key, double p)
void decreaseKey(int key)
double ANALYSIS_EXPORT min(double x, double y)
Returns the minimum of two doubles or the first argument if both are equal.
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...