Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

Loading...
Searching...
No Matches
ogdf::PairingHeapNode< T > Struct Template Reference

Pairing heap node. More...

#include <ogdf/basic/heap/PairingHeap.h>

Protected Member Functions

 PairingHeapNode (const T &valueOfNode)
 Creates heap node with a given valueOfNode.
 

Protected Attributes

PairingHeapNode< T > * child
 First child of the node.
 
PairingHeapNode< T > * next
 Next sibling of the node.
 
PairingHeapNode< T > * prev
 Previous sibling of the node or parent.
 
value
 Value contained in the node.
 

Friends

template<typename , typename >
class PairingHeap
 

Detailed Description

template<typename T>
struct ogdf::PairingHeapNode< T >

Pairing heap node.

Definition at line 43 of file PairingHeap.h.

Constructor & Destructor Documentation

◆ PairingHeapNode()

template<typename T >
ogdf::PairingHeapNode< T >::PairingHeapNode ( const T &  valueOfNode)
inlineexplicitprotected

Creates heap node with a given valueOfNode.

Definition at line 55 of file PairingHeap.h.

Friends And Related Symbol Documentation

◆ PairingHeap

template<typename T >
template<typename , typename >
friend class PairingHeap
friend

Definition at line 45 of file PairingHeap.h.

Member Data Documentation

◆ child

template<typename T >
PairingHeapNode<T>* ogdf::PairingHeapNode< T >::child
protected

First child of the node.

Definition at line 52 of file PairingHeap.h.

◆ next

template<typename T >
PairingHeapNode<T>* ogdf::PairingHeapNode< T >::next
protected

Next sibling of the node.

Definition at line 51 of file PairingHeap.h.

◆ prev

template<typename T >
PairingHeapNode<T>* ogdf::PairingHeapNode< T >::prev
protected

Previous sibling of the node or parent.

Definition at line 50 of file PairingHeap.h.

◆ value

template<typename T >
T ogdf::PairingHeapNode< T >::value
protected

Value contained in the node.

Definition at line 48 of file PairingHeap.h.


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