FibonacciHeap Struct Reference

The Fibonacci Heap datastructure as collection of Heap-ordered Trees. More...

#include <fibonacci_heap.h>

Public Attributes
OrdTreeNode *	min_root
	The root of the Heap-ordered Tree with the minimum value.
OrdTreeNode *	head_tree_list
	The root of the head Tree in the Fibonacci Heap.
OrdTreeNode *	tail_tree_list
	The root of the tail Tree in the Fibonacci Heap.
unsigned short	num_nodes
	The number of Nodes in the Heap.
unsigned short	num_trees
	The number of Trees in the Heap.

Detailed Description

The Fibonacci Heap datastructure as collection of Heap-ordered Trees.

Definition at line 43 of file fibonacci_heap.h.

Member Data Documentation

head_tree_list

OrdTreeNode* FibonacciHeap::head_tree_list

The root of the head Tree in the Fibonacci Heap.

Definition at line 45 of file fibonacci_heap.h.

min_root

OrdTreeNode* FibonacciHeap::min_root

The root of the Heap-ordered Tree with the minimum value.

Definition at line 44 of file fibonacci_heap.h.

num_nodes

unsigned short FibonacciHeap::num_nodes

The number of Nodes in the Heap.

Definition at line 47 of file fibonacci_heap.h.

num_trees

unsigned short FibonacciHeap::num_trees

The number of Trees in the Heap.

Definition at line 48 of file fibonacci_heap.h.

tail_tree_list

OrdTreeNode* FibonacciHeap::tail_tree_list

The root of the tail Tree in the Fibonacci Heap.

Definition at line 46 of file fibonacci_heap.h.