|
typedef BinHeap< typename
GT::Arc *, Distance_Compare
< GT, Distance > > | Heap |
|
typedef Heap::Node | Node |
|
typedef BinHeapNode< GT::Arc * > | Node |
| El tipo de nodo del heap.
|
|
typedef BinHeapNode< GT::Arc * > | Node |
|
|
Distance & | get_distance () |
|
| ArcHeap (Distance &__dist, Access_Heap_Node &&acc=Access_Heap_Node()) |
|
void | put_arc (typename GT::Arc *arc, typename GT::Node *tgt) |
|
GT::Arc * | get_min_arc () |
|
void | empty () |
|
Distance_Compare< GT, Distance > & | key_comp () |
|
Distance_Compare< GT, Distance > & | get_compare () |
|
void | swap (GenBinHeap &h) |
|
Node * | getRoot () |
|
Node * | getRoot () const |
|
void | for_each_in_preorder (Node *p, Op &op) |
|
void | for_each_in_preorder (Node *p, Op &&op()) |
|
bool | level_traverse (Node *root, Op &operation) |
|
bool | level_traverse (Node *root, Op &&operation=Op()) |
|
bool | level_traverse (Node *root, Op &operation) const |
|
bool | level_traverse (Node *root, Op &&operation=Op()) const |
|
| GenBinHeap (Distance_Compare< GT, Distance > &__cmp) |
|
| GenBinHeap (Distance_Compare< GT, Distance > &&__cmp=Distance_Compare< GT, Distance >()) |
|
Node * | insert (Node *p) |
|
Node * | getMin () throw (std::exception, std::underflow_error) |
|
Node * | getMax () throw (std::exception, std::underflow_error) |
|
void | update (Node *p) |
|
Node * | remove (Node *node) throw (std::exception, std::underflow_error) |
|
void | remove_all_and_delete () |
|
Node * | top () const throw (std::exception, std::underflow_error) |
|
const size_t & | size () const |
| Retorna la cardinalidad del heap.
|
|
bool | is_empty () const |
| Retorna true si el heap está vacío.
|
|
bool | verify_heap () |
|
|
Node * | advance_left (Node *p) |
|
Node * | advance_right (Node *p) |
|
virtual bool | verify_heap (Node *p) |
|
La documentación para esta clase fue generada a partir del siguiente fichero: