#include <BCP_tm_node.hpp>
Collaboration diagram for BCP_tree:

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_ |
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] |
| BCP_vec<BCP_tm_node*>::iterator BCP_tree::begin | ( | ) | [inline] |
| BCP_vec<BCP_tm_node*>::iterator BCP_tree::end | ( | ) | [inline] |
| BCP_tm_node* BCP_tree::root | ( | ) | [inline] |
| BCP_tm_node* BCP_tree::operator[] | ( | int | index | ) | [inline] |
| size_t BCP_tree::size | ( | ) | const [inline] |
| int BCP_tree::maxdepth | ( | ) | const [inline] |
| int BCP_tree::processed | ( | ) | const [inline] |
| void BCP_tree::increase_processed | ( | ) | [inline] |
| 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.
References BCP_tm_node::_index, BCP_tm_node::_level, _tree, maxdepth_, BCP_vec< T >::push_back(), and BCP_vec< T >::size().
| 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.
References _tree.
BCP_vec<BCP_tm_node*> BCP_tree::_tree [private] |
Definition at line 205 of file BCP_tm_node.hpp.
Referenced by begin(), end(), insert(), operator[](), remove(), root(), size(), and ~BCP_tree().
int BCP_tree::maxdepth_ [private] |
int BCP_tree::processed_ [private] |
Definition at line 208 of file BCP_tm_node.hpp.
Referenced by increase_processed(), and processed().
1.4.7