1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
|
/*
* libpal - Automated Placement of Labels Library
*
* Copyright (C) 2008 Maxence Laurent, MIS-TIC, HEIG-VD
* University of Applied Sciences, Western Switzerland
* http://www.hes-so.ch
*
* Contact:
* maxence.laurent <at> heig-vd <dot> ch
* or
* eric.taillard <at> heig-vd <dot> ch
*
* This file is part of libpal.
*
* libpal is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* libpal is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with libpal. If not, see <http://www.gnu.org/licenses/>.
*
*/
#ifdef HAVE_CONFIG_H
#include <config.h>
#endif
#ifndef _PRIORITYQUEUE_H
#define _PRIORITYQUEUE_H
#include <iostream>
#define LEFT(x) (2*x+1)
#define RIGHT(x) (2*x+2)
#define PARENT(x) ((x-1)/2)
namespace pal
{
class PriorityQueue
{
private:
int size;
int maxsize;
int maxId;
int *heap;
double *p;
int *pos;
bool ( *greater )( double l, double r );
public:
/** \brief 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
*/
PriorityQueue( int n, int maxId, bool min );
~PriorityQueue();
void print();
int getSize();
int getSizeByPos();
bool isIn( int key );
int getBest(); // O(log n)
void remove( int key );
void insert( int key, double p );
void sort(); // O(n log n)
void downheap( int id );
void upheap( int key );
void decreaseKey( int key );
void setPriority( int key, double new_p );
int getId( int key );
};
} // namespace
#endif
|