31 void insert(
double time,
int Ind);
32 void update(
double time,
int Ind);
60 void recurse(
int row,
int pad,
int spacing,
int S);
double getSmallest(int *Ind)
void swapElements(int Ind1, int Ind2)
void recurse(int row, int pad, int spacing, int S)
Used by printTree. Does the actual printing, top-down.
int checkHeapProperty(int pInd)
Debugging tools.
void insert(double time, int Ind)
void upHeap(int Ind)
Elementary heap operations.
Class implementing a heap, which is an auxiliary data structure used for efficient sorting and exploi...
int heapCount
Keeps track of the number of elements in heap.
double * Keys
Heap arrays: Keys contains certain real values that need to be sorted.
void setToEmpty(int N)
Interface with external algorithms (such as fast marching)
int leftChildInd(int inInd)
int parentInd(int inInd)
Index calculations.
int rightChildInd(int inInd)
void update(double time, int Ind)
double * formMatrix(int m, int n)
int Initial_Heap_Alloc_Size
Variables that control the memory allocation for the heap.
the oofem namespace is to define a context or scope in which all oofem names are defined.
Heap(int N)
Constructor and destructor.