BCP_node_queue Class Reference
#include <BCP_tm_node.hpp>
Public Member Functions | |
| bool | empty () const |
| Return whether the queue is empty or not. | |
| BCP_tm_node * | top () const |
| Return the top member of the queue. | |
| void | pop () |
| Delete the top member of the queue. | |
| void | insert (BCP_tm_node *node) |
| Insert a new node into the queue. | |
| void | compare_to_UB (int &quality_above_UB, int &quality_below_UB) |
| Find out how many candidates are below/above the current best upper bound (including the granularity!). | |
Constructor and destructor | |
| BCP_node_queue (BCP_tm_prob &p) | |
| ~BCP_node_queue () | |
Private Member Functions | |
| BCP_node_queue () | |
| BCP_node_queue (const BCP_node_queue &) | |
| BCP_node_queue & | operator= (const BCP_node_queue &) |
Private Attributes | |
Private data members | |
| BCP_tm_prob & | _p |
| A reference to the problem structure so that we can invoke the method comparing two search tree nodes. | |
| BCP_vec< BCP_tm_node * > | _pq |
| The tree nodes in the priority queue. | |
Detailed Description
Definition at line 264 of file BCP_tm_node.hpp.
Constructor & Destructor Documentation
| BCP_node_queue::BCP_node_queue | ( | ) | [private] |
| BCP_node_queue::BCP_node_queue | ( | const BCP_node_queue & | ) | [private] |
| BCP_node_queue::BCP_node_queue | ( | BCP_tm_prob & | p | ) | [inline] |
Definition at line 287 of file BCP_tm_node.hpp.
| BCP_node_queue::~BCP_node_queue | ( | ) | [inline] |
Definition at line 289 of file BCP_tm_node.hpp.
Member Function Documentation
| BCP_node_queue& BCP_node_queue::operator= | ( | const BCP_node_queue & | ) | [private] |
| bool BCP_node_queue::empty | ( | ) | const [inline] |
Return whether the queue is empty or not.
Definition at line 293 of file BCP_tm_node.hpp.
| BCP_tm_node* BCP_node_queue::top | ( | ) | const [inline] |
Return the top member of the queue.
Definition at line 296 of file BCP_tm_node.hpp.
| void BCP_node_queue::pop | ( | ) |
Delete the top member of the queue.
| void BCP_node_queue::insert | ( | BCP_tm_node * | node | ) |
Insert a new node into the queue.
| void BCP_node_queue::compare_to_UB | ( | int & | quality_above_UB, | |
| int & | quality_below_UB | |||
| ) |
Find out how many candidates are below/above the current best upper bound (including the granularity!).
Member Data Documentation
BCP_tm_prob& BCP_node_queue::_p [private] |
A reference to the problem structure so that we can invoke the method comparing two search tree nodes.
Definition at line 275 of file BCP_tm_node.hpp.
BCP_vec<BCP_tm_node*> BCP_node_queue::_pq [private] |
The tree nodes in the priority queue.
Note that the 0-th entry is not used in the tree (the loops are much nicer that way) and is always a NULL pointer.
Definition at line 280 of file BCP_tm_node.hpp.
The documentation for this class was generated from the following file:
- /home/coin/svn-release/OptimizationSuite-1.1.0/Bcp/src/include/BCP_tm_node.hpp
