$extrastylesheet
#include <mln/util/fibonacci_heap.hh>
Public Member Functions | |
fibonacci_heap_node () | |
fibonacci_heap_node (const P &priority, const T &value) | |
~fibonacci_heap_node () | |
fibonacci_heap_node< P, T > * | child () const |
short | degree () const |
fibonacci_heap_node< P, T > * | left () const |
short | mark () const |
bool | operator< (fibonacci_heap_node< P, T > &rhs) |
void | operator= (fibonacci_heap_node< P, T > &rhs) |
bool | operator== (fibonacci_heap_node< P, T > &rhs) |
fibonacci_heap_node< P, T > * | parent () const |
void | print_ (std::ostream &ostr) const |
const P & | priority () const |
fibonacci_heap_node< P, T > * | right () const |
void | set_child (fibonacci_heap_node< P, T > *node) |
void | set_degree (short degree) |
void | set_left (fibonacci_heap_node< P, T > *node) |
void | set_mark (short mark) |
void | set_parent (fibonacci_heap_node< P, T > *node) |
void | set_right (fibonacci_heap_node< P, T > *node) |
void | set_value (const T &) |
const T & | value () const |
Definition at line 51 of file fibonacci_heap.hh.
mln::util::internal::fibonacci_heap_node< P, T >::fibonacci_heap_node | ( | ) |
Default constructor.
mln::util::internal::fibonacci_heap_node< P, T >::fibonacci_heap_node | ( | const P & | priority, |
const T & | value | ||
) |
Construct a new node with value
as value.
mln::util::internal::fibonacci_heap_node< P, T >::~fibonacci_heap_node | ( | ) |
fibonacci_heap_node<P,T>* mln::util::internal::fibonacci_heap_node< P, T >::child | ( | ) | const |
short mln::util::internal::fibonacci_heap_node< P, T >::degree | ( | ) | const |
fibonacci_heap_node<P,T>* mln::util::internal::fibonacci_heap_node< P, T >::left | ( | ) | const |
short mln::util::internal::fibonacci_heap_node< P, T >::mark | ( | ) | const |
bool mln::util::internal::fibonacci_heap_node< P, T >::operator< | ( | fibonacci_heap_node< P, T > & | rhs | ) |
void mln::util::internal::fibonacci_heap_node< P, T >::operator= | ( | fibonacci_heap_node< P, T > & | rhs | ) |
bool mln::util::internal::fibonacci_heap_node< P, T >::operator== | ( | fibonacci_heap_node< P, T > & | rhs | ) |
fibonacci_heap_node<P,T>* mln::util::internal::fibonacci_heap_node< P, T >::parent | ( | ) | const |
void mln::util::internal::fibonacci_heap_node< P, T >::print_ | ( | std::ostream & | ostr | ) | const |
const P& mln::util::internal::fibonacci_heap_node< P, T >::priority | ( | ) | const |
fibonacci_heap_node<P,T>* mln::util::internal::fibonacci_heap_node< P, T >::right | ( | ) | const |
void mln::util::internal::fibonacci_heap_node< P, T >::set_child | ( | fibonacci_heap_node< P, T > * | node | ) |
void mln::util::internal::fibonacci_heap_node< P, T >::set_degree | ( | short | degree | ) |
void mln::util::internal::fibonacci_heap_node< P, T >::set_left | ( | fibonacci_heap_node< P, T > * | node | ) |
void mln::util::internal::fibonacci_heap_node< P, T >::set_mark | ( | short | mark | ) |
void mln::util::internal::fibonacci_heap_node< P, T >::set_parent | ( | fibonacci_heap_node< P, T > * | node | ) |
void mln::util::internal::fibonacci_heap_node< P, T >::set_right | ( | fibonacci_heap_node< P, T > * | node | ) |
void mln::util::internal::fibonacci_heap_node< P, T >::set_value | ( | const T & | ) |
const T& mln::util::internal::fibonacci_heap_node< P, T >::value | ( | ) | const |
Return the node value.