A BinaryHeap is a core data structure that represents a heap within a fixed array of size n elements. More...
Go to the source code of this file.
Classes | |
| struct | elt |
| Element stored within the Binary Heap. More... | |
| class | BinaryHeap |
| A BinaryHeap is to be used as a priority queue. More... | |
Defines | |
| #define | INC_INSERT |
| #define | INC_SMALL |
| #define | INC_COMP |
| #define | INC_SWAP |
| #define | INC_DECREASE |
Typedefs | |
| typedef elt | ELEMENT |
| Element stored within the Binary Heap. | |
| typedef elt * | ELEMENT_PTR |
| Element stored within the Binary Heap. | |
A BinaryHeap is a core data structure that represents a heap within a fixed array of size n elements.
In this implementation, the elements are all integers.
| #define INC_COMP |
| #define INC_DECREASE |
| #define INC_INSERT |
| #define INC_SMALL |
| #define INC_SWAP |
| typedef struct elt * ELEMENT_PTR |
Element stored within the Binary Heap.
Algorithm Development Kit 1.0