|  | Parasol Planning Library (PPL)
    | 
#include <FibonocciHeap.h>

| Data Fields | |
| int | degree | 
| FibonacciNode * | parent | 
| FibonacciNode * | child | 
| FibonacciNode * | left | 
| FibonacciNode * | right | 
| bool | mark | 
| bool | is_infinity | 
| double | key | 
| size_t | m_VID | 
node structure for a node in fibonacci heap
| FibonacciNode* FibonacciHeap< State, Action >::FibonacciNode::child | 
| int FibonacciHeap< State, Action >::FibonacciNode::degree | 
| bool FibonacciHeap< State, Action >::FibonacciNode::is_infinity | 
| double FibonacciHeap< State, Action >::FibonacciNode::key | 
| FibonacciNode* FibonacciHeap< State, Action >::FibonacciNode::left | 
| size_t FibonacciHeap< State, Action >::FibonacciNode::m_VID | 
| bool FibonacciHeap< State, Action >::FibonacciNode::mark | 
| FibonacciNode* FibonacciHeap< State, Action >::FibonacciNode::parent | 
| FibonacciNode* FibonacciHeap< State, Action >::FibonacciNode::right |