Parasol Planning Library (PPL)
Data Fields
FibonacciHeap< State, Action >::FibonacciNode Struct Reference

#include <FibonocciHeap.h>

Collaboration diagram for FibonacciHeap< State, Action >::FibonacciNode:
Collaboration graph
[legend]

Data Fields

int degree
 
FibonacciNodeparent
 
FibonacciNodechild
 
FibonacciNodeleft
 
FibonacciNoderight
 
bool mark
 
bool is_infinity
 
double key
 
size_t m_VID
 

Detailed Description

template<typename State, typename Action>
struct FibonacciHeap< State, Action >::FibonacciNode

node structure for a node in fibonacci heap

Field Documentation

◆ child

template<typename State , typename Action >
FibonacciNode* FibonacciHeap< State, Action >::FibonacciNode::child

◆ degree

template<typename State , typename Action >
int FibonacciHeap< State, Action >::FibonacciNode::degree

◆ is_infinity

template<typename State , typename Action >
bool FibonacciHeap< State, Action >::FibonacciNode::is_infinity

◆ key

template<typename State , typename Action >
double FibonacciHeap< State, Action >::FibonacciNode::key

◆ left

template<typename State , typename Action >
FibonacciNode* FibonacciHeap< State, Action >::FibonacciNode::left

◆ m_VID

template<typename State , typename Action >
size_t FibonacciHeap< State, Action >::FibonacciNode::m_VID

◆ mark

template<typename State , typename Action >
bool FibonacciHeap< State, Action >::FibonacciNode::mark

◆ parent

template<typename State , typename Action >
FibonacciNode* FibonacciHeap< State, Action >::FibonacciNode::parent

◆ right

template<typename State , typename Action >
FibonacciNode* FibonacciHeap< State, Action >::FibonacciNode::right

The documentation for this struct was generated from the following file: