#include <gdtnode_pq.h>
Public Member Functions | |
gdtnode_pq (const undi_graph &_g) | |
~gdtnode_pq () | |
void | insert (gdtnode v, const P &p) |
const P & | prio (gdtnode v) const |
bool | member (gdtnode v) const |
void | decrease_p (gdtnode v, const P &p) |
gdtnode | find_min () const |
void | del (gdtnode v) |
gdtnode | del_min () |
void | get_nodes (gdtlist< gdtnode > &l) |
void | clear () |
const P & | inf (gdtnode v) const |
void | decrease_inf (gdtnode v, const P &x) |
Definition at line 12 of file gdtnode_pq.h.
gdt::gdtnode_pq< P >::gdtnode_pq | ( | const undi_graph & | _g | ) | [inline] |
Definition at line 20 of file gdtnode_pq.h.
gdt::gdtnode_pq< P >::~gdtnode_pq | ( | ) | [inline] |
Definition at line 22 of file gdtnode_pq.h.
void gdt::gdtnode_pq< P >::insert | ( | gdtnode | v, | |
const P & | p | |||
) | [inline] |
Definition at line 24 of file gdtnode_pq.h.
References gdt::gdtp_queue< P, I, less >::insert().
const P& gdt::gdtnode_pq< P >::prio | ( | gdtnode | v | ) | const [inline] |
Definition at line 29 of file gdtnode_pq.h.
References gdt::gdtp_queue< P, I, less >::prio().
bool gdt::gdtnode_pq< P >::member | ( | gdtnode | v | ) | const [inline] |
void gdt::gdtnode_pq< P >::decrease_p | ( | gdtnode | v, | |
const P & | p | |||
) | [inline] |
Definition at line 33 of file gdtnode_pq.h.
References gdt::gdtp_queue< P, I, less >::decrease_p().
gdtnode gdt::gdtnode_pq< P >::find_min | ( | ) | const [inline] |
Reimplemented from gdt::gdtp_queue< P, I, less >.
Definition at line 35 of file gdtnode_pq.h.
References gdt::gdtp_queue< P, I, less >::find_min(), and gdt::gdtp_queue< P, I, less >::inf().
Referenced by gdt::gdtnode_pq< P >::del_min().
void gdt::gdtnode_pq< P >::del | ( | gdtnode | v | ) | [inline] |
Definition at line 37 of file gdtnode_pq.h.
References gdt::gdtp_queue< P, I, less >::del_item().
gdtnode gdt::gdtnode_pq< P >::del_min | ( | ) | [inline] |
Reimplemented from gdt::gdtp_queue< P, I, less >.
Definition at line 42 of file gdtnode_pq.h.
References gdt::gdtp_queue< P, I, less >::del_min(), and gdt::gdtnode_pq< P >::find_min().
void gdt::gdtnode_pq< P >::get_nodes | ( | gdtlist< gdtnode > & | l | ) | [inline] |
Definition at line 49 of file gdtnode_pq.h.
References gdt::gdtlist< E >::append(), gdt::gdtlist< E >::clear(), forall_items, and gdt::gdtp_queue< P, I, less >::inf().
void gdt::gdtnode_pq< P >::clear | ( | ) | [inline] |
Definition at line 59 of file gdtnode_pq.h.
const P& gdt::gdtnode_pq< P >::inf | ( | gdtnode | v | ) | const [inline] |
Definition at line 64 of file gdtnode_pq.h.
References gdt::gdtp_queue< P, I, less >::prio().
void gdt::gdtnode_pq< P >::decrease_inf | ( | gdtnode | v, | |
const P & | x | |||
) | [inline] |
Definition at line 68 of file gdtnode_pq.h.
References gdt::gdtp_queue< P, I, less >::decrease_p().