NO OLD DOC. More...
#include <BCP_tm_node.hpp>
Public Member Functions | |
Constructor and destructor | |
BCP_tree () | |
~BCP_tree () | |
Query methods | |
BCP_vec< BCP_tm_node * >::iterator | begin () |
BCP_vec< BCP_tm_node * >::iterator | end () |
BCP_tm_node * | root () |
BCP_tm_node * | operator[] (int index) |
size_t | size () const |
int | maxdepth () const |
int | processed () const |
void | increase_processed () |
Modifying methods | |
double | true_lower_bound (const BCP_tm_node *node) const |
Return the worst true lower bound in the search tree. | |
void | enumerate_leaves (BCP_tm_node *node, const double obj_limit) |
Return the worst true lower bound in the search tree. | |
void | insert (BCP_tm_node *node) |
Return the worst true lower bound in the search tree. | |
void | remove (int index) |
Return the worst true lower bound in the search tree. | |
Private Attributes | |
BCP_vec< BCP_tm_node * > | _tree |
int | maxdepth_ |
int | processed_ |
NO OLD DOC.
Definition at line 202 of file BCP_tm_node.hpp.
BCP_tree::BCP_tree | ( | ) | [inline] |
Definition at line 214 of file BCP_tm_node.hpp.
BCP_tree::~BCP_tree | ( | ) | [inline] |
Definition at line 216 of file BCP_tm_node.hpp.
BCP_vec<BCP_tm_node*>::iterator BCP_tree::begin | ( | ) | [inline] |
Definition at line 226 of file BCP_tm_node.hpp.
BCP_vec<BCP_tm_node*>::iterator BCP_tree::end | ( | ) | [inline] |
Definition at line 228 of file BCP_tm_node.hpp.
BCP_tm_node* BCP_tree::root | ( | ) | [inline] |
Definition at line 231 of file BCP_tm_node.hpp.
BCP_tm_node* BCP_tree::operator[] | ( | int | index | ) | [inline] |
Definition at line 233 of file BCP_tm_node.hpp.
size_t BCP_tree::size | ( | ) | const [inline] |
Definition at line 235 of file BCP_tm_node.hpp.
int BCP_tree::maxdepth | ( | ) | const [inline] |
Definition at line 237 of file BCP_tm_node.hpp.
int BCP_tree::processed | ( | ) | const [inline] |
Definition at line 239 of file BCP_tm_node.hpp.
void BCP_tree::increase_processed | ( | ) | [inline] |
Definition at line 240 of file BCP_tm_node.hpp.
double BCP_tree::true_lower_bound | ( | const BCP_tm_node * | node | ) | const |
Return the worst true lower bound in the search tree.
void BCP_tree::enumerate_leaves | ( | BCP_tm_node * | node, | |
const double | obj_limit | |||
) |
Return the worst true lower bound in the search tree.
void BCP_tree::insert | ( | BCP_tm_node * | node | ) | [inline] |
Return the worst true lower bound in the search tree.
Definition at line 250 of file BCP_tm_node.hpp.
void BCP_tree::remove | ( | int | index | ) | [inline] |
Return the worst true lower bound in the search tree.
Definition at line 256 of file BCP_tm_node.hpp.
BCP_vec<BCP_tm_node*> BCP_tree::_tree [private] |
Definition at line 205 of file BCP_tm_node.hpp.
int BCP_tree::maxdepth_ [private] |
Definition at line 207 of file BCP_tm_node.hpp.
int BCP_tree::processed_ [private] |
Definition at line 208 of file BCP_tm_node.hpp.