Extends THeapElement to provide a heap element that defines an integer priority, which is used to sort heap elements in a heap.
A heap is a complete binary tree where every node's value is guaranteed to be greater than its children's values.
Namespace: DataStructures
|
Name
|
Description
|
|
Index
|
Specifies the position of the heap element in the heap. (Inherited from DataStructures.THeapElement.)
|
|
Item
|
Specifies an object associated with the heap element. This is the object to store in the heap, not the value that defines the heap order. (Inherited from DataStructures.THeapElement.)
|
|
Priority
|
Defines the priority value for the heap element.
A heap is a complete binary tree where every node's value (this priority) is guaranteed to be greater than its children's values.
|
Top
|