|
Open Graph Drawing Framework |
v. 2023.09 (Elderberry)
|
|
|
Go to the documentation of this file.
56 template<
class Type,
class Key>
72 void insert(Type elem, Key key);
81 int getMin(Type &min)
const;
int getMinKey(Key &minKey) const
Retrieves the key of the minimal element in the priority queue.
AbaPrioQueue(int size)
The constructor of an empty priority queue.
void insert(Type elem, Key key)
Inserts an element in the priority queue.
int getMin(Type &min) const
Retrieves the element with minimal key from the priority queue.
Base class of all other classes of ABACUS.
int number() const
Returns the number of elements stored in the priority queue.
AbaBHeap< Type, Key > heap_
The heap implementing the priority queue.
void clear()
Makes the priority queue empty.
void realloc(int newSize)
Increases the size of the priority queue.
int extractMin(Type &min)
Retrieves and removes the minimal element from the priority queue.
int size() const
Returns the maximal number of elements which can be stored in the priority queue.