Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
Public Member Functions | Data Fields
alib::BinomialHeap< T, Comparator >::Node Struct Reference

#include <BinomialHeap.h>

Collaboration diagram for alib::BinomialHeap< T, Comparator >::Node:
[legend]

Public Member Functions

 Node (const T &val, unsigned deg=0, Node *par=nullptr, Node *chld=nullptr, Node *sib=nullptr)
 

Data Fields

value
 
unsigned degree
 
Nodeparent
 
Nodechild
 
Nodesibling
 

Constructor & Destructor Documentation

◆ Node()

template<typename T , typename Comparator = std::less < T >>
alib::BinomialHeap< T, Comparator >::Node::Node ( const T &  val,
unsigned  deg = 0,
Node par = nullptr,
Node chld = nullptr,
Node sib = nullptr 
)
inline

Field Documentation

◆ child

template<typename T , typename Comparator = std::less < T >>
Node* alib::BinomialHeap< T, Comparator >::Node::child

◆ degree

template<typename T , typename Comparator = std::less < T >>
unsigned alib::BinomialHeap< T, Comparator >::Node::degree

◆ parent

template<typename T , typename Comparator = std::less < T >>
Node* alib::BinomialHeap< T, Comparator >::Node::parent

◆ sibling

template<typename T , typename Comparator = std::less < T >>
Node* alib::BinomialHeap< T, Comparator >::Node::sibling

◆ value

template<typename T , typename Comparator = std::less < T >>
T alib::BinomialHeap< T, Comparator >::Node::value

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