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)
76 bool isIn(
int key )
const;
81 void insert(
int key,
double p );
92 int getId(
int key )
const;
102 bool ( *greater )(
double l,
double r );
Custom priority queue for use in pal labeling engine.
PriorityQueue(const PriorityQueue &)=delete
PriorityQueue cannot be copied.
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)
void setPriority(int key, double new_p)
void insert(int key, double p)
PriorityQueue & operator=(const PriorityQueue &)=delete
PriorityQueue cannot be copied.