CbcNewTree Class Reference
#include <CbcTree.hpp>
Public Member Functions | |
| CbcNewTree () | |
| CbcNewTree (const CbcNewTree &rhs) | |
| CbcNewTree & | operator= (const CbcNewTree &rhs) |
| virtual | ~CbcNewTree () |
| virtual CbcNewTree * | clone () const |
| Clone. | |
| virtual void | generateCpp (FILE *fp) |
| Create C++ lines to get to current state. | |
Heap access and maintenance methods | |
| void | setComparison (CbcCompareBase &compare) |
| Set comparison function and resort heap. | |
| virtual CbcNode * | top () const |
| Return the top node of the heap. | |
| virtual void | push (CbcNode *x) |
| Add a node to the heap. | |
| virtual void | pop () |
| Remove the top node from the heap. | |
| virtual CbcNode * | bestNode (double cutoff) |
| Gets best node and takes off heap. | |
vector methods | |
| virtual bool | empty () |
| Test if empty *** note may be overridden. | |
| int | size () const |
| Return size. | |
| CbcNode * | operator[] (int i) const |
| [] operator | |
| CbcNode * | nodePointer (int i) const |
| Return a node pointer. | |
Search tree maintenance | |
| void | cleanTree (CbcModel *model, double cutoff, double &bestPossibleObjective) |
| Prune the tree using an objective function cutoff. | |
| CbcNode * | bestAlternate () |
| Get best on list using alternate method. | |
| virtual void | endSearch () |
| We may have got an intelligent tree so give it one more chance. | |
Detailed Description
Definition at line 112 of file CbcTree.hpp.
Constructor & Destructor Documentation
| CbcNewTree::CbcNewTree | ( | ) |
| CbcNewTree::CbcNewTree | ( | const CbcNewTree & | rhs | ) |
| virtual CbcNewTree::~CbcNewTree | ( | ) | [virtual] |
Member Function Documentation
| CbcNewTree& CbcNewTree::operator= | ( | const CbcNewTree & | rhs | ) |
Reimplemented from CbcTree.
| virtual CbcNewTree* CbcNewTree::clone | ( | ) | const [virtual] |
Clone.
Reimplemented from CbcTree.
| virtual void CbcNewTree::generateCpp | ( | FILE * | fp | ) | [inline, virtual] |
Create C++ lines to get to current state.
Reimplemented from CbcTree.
Definition at line 129 of file CbcTree.hpp.
| void CbcNewTree::setComparison | ( | CbcCompareBase & | compare | ) |
Set comparison function and resort heap.
Reimplemented from CbcTree.
| virtual CbcNode* CbcNewTree::top | ( | ) | const [virtual] |
Return the top node of the heap.
Reimplemented from CbcTree.
| virtual void CbcNewTree::push | ( | CbcNode * | x | ) | [virtual] |
Add a node to the heap.
Reimplemented from CbcTree.
| virtual void CbcNewTree::pop | ( | ) | [virtual] |
Remove the top node from the heap.
Reimplemented from CbcTree.
| virtual CbcNode* CbcNewTree::bestNode | ( | double | cutoff | ) | [virtual] |
Gets best node and takes off heap.
Reimplemented from CbcTree.
| virtual bool CbcNewTree::empty | ( | ) | [virtual] |
Test if empty *** note may be overridden.
Reimplemented from CbcTree.
| int CbcNewTree::size | ( | ) | const [inline, virtual] |
| CbcNode* CbcNewTree::operator[] | ( | int | i | ) | const [inline] |
[] operator
Definition at line 160 of file CbcTree.hpp.
| CbcNode* CbcNewTree::nodePointer | ( | int | i | ) | const [inline] |
Return a node pointer.
Definition at line 164 of file CbcTree.hpp.
| void CbcNewTree::cleanTree | ( | CbcModel * | model, | |
| double | cutoff, | |||
| double & | bestPossibleObjective | |||
| ) | [virtual] |
| CbcNode* CbcNewTree::bestAlternate | ( | ) |
Get best on list using alternate method.
Reimplemented from CbcTree.
| virtual void CbcNewTree::endSearch | ( | ) | [inline, virtual] |
We may have got an intelligent tree so give it one more chance.
Reimplemented from CbcTree.
Definition at line 186 of file CbcTree.hpp.
The documentation for this class was generated from the following file:
- /home/coin/svn-release/OptimizationSuite-1.1.0/Cbc/src/CbcTree.hpp
