182 return (m_MinRoot ==
nullptr);
196 return m_NumMarkedNodes;
257 long m_NumMarkedNodes;
264 #endif //__VTK_WRAP__
bool operator<(FibHeapNode &RHS)
Compare key value.
void Print(FibHeapNode *Tree=nullptr, FibHeapNode *theParent=nullptr)
int Delete(FibHeapNode *theNode)
static const NodeIndexType NullNodeIndex
void SetIndexValue(NodeIndexType indexValue)
void Union(FibHeap *OtherHeap)
Union() - O(1) actual; O(1) amortized.
FibHeapNode * ExtractMin()
ExtractMin() - O(n) worst-case actual; O(lg n) amortized.
unsigned int NodeIndexType
void Insert(FibHeapNode *NewNode)
NodeIndexType GetIndexValue()
Index stores this node's location in the node array.
bool operator==(FibHeapNode &RHS)
Compare key value.
void operator=(NodeKeyValueType newKeyVal)
Set key value (that the nodes are sorted based on)
static const NodeKeyValueType NegativeInfinity
NodeKeyValueType GetKeyValue()
int DecreaseKey(FibHeapNode *theNode, NodeKeyValueType keyValue)
FibHeapNode * Minimum()
Minimum - O(1) actual; O(1) amortized.
void SetHeapNodes(FibHeapNode *heapNodes)