alib::FibonacciHeap< T, Comparator >::Node Struct Reference

#include <FibonacciHeap.h>

Collaboration diagram for alib::FibonacciHeap< T, Comparator >::Node:

Public Member Functions
	Node (const T &val, unsigned deg=0, Node *par=nullptr, Node *chld=nullptr, Node *pr=nullptr, Node *ne=nullptr)

Data Fields
T	value
unsigned	degree
bool	mark
Node *	parent
Node *	child
Node *	prev
Node *	next

Constructor & Destructor Documentation

Node()

template<typename T , typename Comparator = std::less < T >>

alib::FibonacciHeap< T, Comparator >::Node::Node ( const T &  val, unsigned  deg = 0, Node *  par = nullptr, Node *  chld = nullptr, Node *  pr = nullptr, Node *  ne = nullptr  )

inline

Field Documentation

child

template<typename T , typename Comparator = std::less < T >>

Node* alib::FibonacciHeap< T, Comparator >::Node::child

degree

template<typename T , typename Comparator = std::less < T >>

unsigned alib::FibonacciHeap< T, Comparator >::Node::degree

mark

template<typename T , typename Comparator = std::less < T >>

bool alib::FibonacciHeap< T, Comparator >::Node::mark

next

template<typename T , typename Comparator = std::less < T >>

Node* alib::FibonacciHeap< T, Comparator >::Node::next

parent

template<typename T , typename Comparator = std::less < T >>

Node* alib::FibonacciHeap< T, Comparator >::Node::parent

prev

template<typename T , typename Comparator = std::less < T >>

Node* alib::FibonacciHeap< T, Comparator >::Node::prev

value

template<typename T , typename Comparator = std::less < T >>

T alib::FibonacciHeap< T, Comparator >::Node::value

---

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

• alib2std/src/extensions/heaps/FibonacciHeap.h