The structure that holds a graph node for the graph representation of a Fibonacci heap.
More...
List of all members.
Public Attributes |
| element | key |
| | The value of the element that is used to compare the elements.
|
| bool | mark |
| | A mark bit which indicates whether the node has lost a child since the last time it was made a child of another node.
|
| int_t | degree |
| | The degree of the node, i.e., the number of its children.
|
| int_t | number |
| | The number of this node.
|
| NodePtr | parent |
| | A pointer to the parent node.
|
| NodePtr | child |
| | A pointer to one of the children nodes.
|
| NodePtr | left |
| | A pointer to the left sibling node.
|
| NodePtr | right |
| | A pointer to the right sibling node.
|
Detailed Description
template<class element>
struct chomp::homology::FibonacciHeap< element >::Node
The structure that holds a graph node for the graph representation of a Fibonacci heap.
Definition at line 75 of file fibheap.h.
Member Data Documentation
A pointer to one of the children nodes.
Definition at line 98 of file fibheap.h.
The degree of the node, i.e., the number of its children.
Nodes that have been removed from the heap have the degree set to -1.
Definition at line 89 of file fibheap.h.
The value of the element that is used to compare the elements.
Definition at line 79 of file fibheap.h.
A pointer to the left sibling node.
Definition at line 101 of file fibheap.h.
A mark bit which indicates whether the node has lost a child since the last time it was made a child of another node.
Definition at line 84 of file fibheap.h.
The number of this node.
Definition at line 92 of file fibheap.h.
A pointer to the parent node.
Definition at line 95 of file fibheap.h.
A pointer to the right sibling node.
Definition at line 104 of file fibheap.h.
The documentation for this struct was generated from the following file:
