|
Open Graph Drawing Framework |
v. 2023.09 (Elderberry)
|
|
|
Go to the documentation of this file.
37 template<
class Type,
class Key>
40 template<
class Type,
class Key>
113 void insert(Type elem, Key key);
An array that keeps track of the number of inserted elements; also usable as an efficient stack.
Declaration and implementation of ArrayBuffer class.
void insert(Type elem, Key key)
Inserts an item with a key into the heap.
AbaBHeap(int size)
A constructor.
std::ostream & operator<<(std::ostream &out, const Active< BaseType, CoType > &rhs)
Key getMinKey() const
Returns the key of the minimum element of the heap.
void clear()
Empties the heap.
void heapify(int i)
Is the central function to maintain the heap property.
bool empty() const
Return true if there are no elements in the heap, false otherwise.
int father(int i) const
Returns the index of the father of element i.
int rightSon(int i) const
Returns the index of the right son of node i.
int leftSon(int i) const
Returns the index of the left son of node i.
Type getMin() const
Returns the minimum element of the heap.
Base class of all other classes of ABACUS.
The parameterized class Array implements dynamic arrays of type E.
void realloc(int newSize)
Changes the size of the heap.
int size() const
Returns the maximal number of elements which can be stored in the heap.
void check() const
Throws an exception if the heap properties are violated.
int number() const
Returns the number of elements in the heap.
Type extractMin()
Accesses and removes the minimum element from the heap.