Go to the documentation of this file.
20 #define DEFAULT_SIZE 10
40 std::vector<graph_object *>
_elts;
void HeapifyUp(int index)
std::vector< graph_object * > _elts
void DecreaseKey(graph_object *val)
Indicate that the key for a particular object has decreased.
Parent class for nodes and edges allowing them to be stored in a Heap or manipulated with other data ...
bool Empty()
Returns true if no items are in the Heap.
graph_object * Remove()
Remove the item with the lowest key from the Heap & re-heapify.
void HeapifyDown(int index)
void Add(graph_object *val)
Add object into Heap.
A simple & efficient Heap class which uses Graph objects.
bool IsIn(graph_object *val)
Returns true if the object is in the Heap.