fibonacci_node< K, V > Class Template Reference

#include <fibonacci_heap.h>

Collaboration diagram for fibonacci_node< K, V >:

Public Member Functions
	fibonacci_node ()
	fibonacci_node (K key, V *data=NULL)
int	compare (fibonacci_node_t *other)
int	compare_data (K key)
fibonacci_node_t *	remove ()
void	link (fibonacci_node_t *parent)
K	get_key ()
V *	get_data ()

Private Types
typedef fibonacci_node< K, V >	fibonacci_node_t

Private Member Functions
void	insert_after (fibonacci_node_t *b)
void	insert_before (fibonacci_node_t *b)

Private Attributes
fibonacci_node *	m_parent
fibonacci_node *	m_child
fibonacci_node *	m_left
fibonacci_node *	m_right
K	m_key
V *	m_data
unsigned int	m_degree: 31
unsigned int	m_mark: 1

Friends
class	fibonacci_heap< K, V >

Detailed Description

template<class K, class V>
class fibonacci_node< K, V >

Fibonacci heap node class.   

Member Typedef Documentation

fibonacci_node_t

template<class K , class V >

typedef fibonacci_node<K,V> fibonacci_node< K, V >::fibonacci_node_t

private

Constructor & Destructor Documentation

fibonacci_node() [1/2]

template<class K , class V >

fibonacci_node< K, V >::fibonacci_node ( )

inline

fibonacci_node() [2/2]

template<class K , class V >

fibonacci_node< K, V >::fibonacci_node ( K key, V * data = NULL )

inline

Member Function Documentation

compare()

template<class K , class V >

int fibonacci_node< K, V >::compare ( fibonacci_node_t * other )

inline

References ggc_alloc(), and fibonacci_node< K, V >::m_key.

Referenced by fibonacci_heap< K, V >::consolidate(), and fibonacci_heap< K, V >::replace_key_data().

compare_data()

template<class K , class V >

int fibonacci_node< K, V >::compare_data ( K key )

inline

Referenced by fibonacci_heap< K, V >::replace_key_data().

get_data()

template<class K , class V >

V * fibonacci_node< K, V >::get_data ( )

inline

References fibonacci_node< K, V >::m_data.

Referenced by update_edge_key().

get_key()

template<class K , class V >

K fibonacci_node< K, V >::get_key ( )

inline

References fibonacci_node< K, V >::m_key.

Referenced by find_traces_1_round(), and update_edge_key().

insert_after()

template<class K , class V >

void fibonacci_node< K, V >::insert_after ( fibonacci_node_t * b )

private

Put node B after this node.   

References a, b, fibonacci_node< K, V >::m_left, and fibonacci_node< K, V >::m_right.

Referenced by fibonacci_node< K, V >::insert_before(), and fibonacci_heap< K, V >::insert_root().

insert_before()

template<class K , class V >

void fibonacci_node< K, V >::insert_before ( fibonacci_node_t * b )

inlineprivate

References b, fibonacci_node< K, V >::insert_after(), and fibonacci_node< K, V >::m_left.

Referenced by fibonacci_node< K, V >::link().

link()

template<class K , class V >

void fibonacci_node< K, V >::link

(

fibonacci_node_t *

parent

)

Link the node with PARENT.   

References fibonacci_node< K, V >::insert_before(), fibonacci_node< K, V >::m_child, fibonacci_node< K, V >::m_degree, fibonacci_node< K, V >::m_mark, fibonacci_node< K, V >::m_parent, and NULL.

remove()

template<class K , class V >

fibonacci_node< K, V > * fibonacci_node< K, V >::remove

(

)

Remove fibonacci heap node.   

References ggc_alloc(), fibonacci_node< K, V >::m_child, fibonacci_node< K, V >::m_left, fibonacci_node< K, V >::m_parent, fibonacci_node< K, V >::m_right, and NULL.

Referenced by fibonacci_heap< K, V >::cut(), and fibonacci_heap< K, V >::remove_root().

Friends And Related Symbol Documentation

fibonacci_heap< K, V >

template<class K , class V >

friend class fibonacci_heap< K, V >

friend

Field Documentation

m_child

template<class K , class V >

fibonacci_node* fibonacci_node< K, V >::m_child

private

Referenced by fibonacci_node< K, V >::link(), and fibonacci_node< K, V >::remove().

m_data

template<class K , class V >

V* fibonacci_node< K, V >::m_data

private

Referenced by fibonacci_heap< K, V >::delete_node(), fibonacci_node< K, V >::get_data(), fibonacci_heap< K, V >::insert(), fibonacci_heap< K, V >::min(), fibonacci_heap< K, V >::replace_key(), and fibonacci_heap< K, V >::replace_key_data().

m_degree

template<class K , class V >

unsigned int fibonacci_node< K, V >::m_degree

private

Referenced by fibonacci_heap< K, V >::consolidate(), fibonacci_heap< K, V >::cut(), and fibonacci_node< K, V >::link().

m_key

template<class K , class V >

K fibonacci_node< K, V >::m_key

private

Referenced by fibonacci_node< K, V >::compare(), fibonacci_node< K, V >::get_key(), fibonacci_heap< K, V >::insert(), fibonacci_heap< K, V >::insert_node(), fibonacci_heap< K, V >::min_key(), fibonacci_heap< K, V >::replace_data(), fibonacci_heap< K, V >::replace_key(), and fibonacci_heap< K, V >::replace_key_data().

m_left

template<class K , class V >

fibonacci_node* fibonacci_node< K, V >::m_left

private

Referenced by fibonacci_node< K, V >::insert_after(), fibonacci_node< K, V >::insert_before(), fibonacci_heap< K, V >::insert_root(), fibonacci_node< K, V >::remove(), and fibonacci_heap< K, V >::remove_root().

m_mark

template<class K , class V >

unsigned int fibonacci_node< K, V >::m_mark

private

Referenced by fibonacci_heap< K, V >::cut(), and fibonacci_node< K, V >::link().

m_parent

template<class K , class V >

fibonacci_node* fibonacci_node< K, V >::m_parent

private

Referenced by fibonacci_heap< K, V >::cut(), fibonacci_heap< K, V >::extract_minimum_node(), fibonacci_node< K, V >::link(), fibonacci_node< K, V >::remove(), and fibonacci_heap< K, V >::replace_key_data().

m_right

template<class K , class V >

fibonacci_node* fibonacci_node< K, V >::m_right

private

Referenced by fibonacci_heap< K, V >::extract_minimum_node(), fibonacci_node< K, V >::insert_after(), fibonacci_heap< K, V >::insert_root(), and fibonacci_node< K, V >::remove().

---

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

• fibonacci_heap.h