#include <priorityqueue.h>
Constructor & Destructor Documentation
pal::PriorityQueue::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 representing the priority @param min best element has the smalest p when min is True ans has the biggest when min is false.
pal::PriorityQueue::~PriorityQueue |
( |
| ) |
|
Member Function Documentation
void pal::PriorityQueue::decreaseKey |
( |
int |
key | ) |
|
void pal::PriorityQueue::downheap |
( |
int |
id | ) |
|
int pal::PriorityQueue::getBest |
( |
| ) |
|
int pal::PriorityQueue::getId |
( |
int |
key | ) |
|
int pal::PriorityQueue::getSize |
( |
| ) |
|
int pal::PriorityQueue::getSizeByPos |
( |
| ) |
|
void pal::PriorityQueue::insert |
( |
int |
key, |
|
|
double |
p |
|
) |
| |
bool pal::PriorityQueue::isIn |
( |
int |
key | ) |
|
void pal::PriorityQueue::print |
( |
| ) |
|
void pal::PriorityQueue::remove |
( |
int |
key | ) |
|
void pal::PriorityQueue::setPriority |
( |
int |
key, |
|
|
double |
new_p |
|
) |
| |
void pal::PriorityQueue::sort |
( |
| ) |
|
void pal::PriorityQueue::upheap |
( |
int |
key | ) |
|
The documentation for this class was generated from the following files: