#include <CbcTree.hpp>
Public Member Functions | |
| CbcTreeArray () | |
| CbcTreeArray (const CbcTreeArray &rhs) | |
| CbcTreeArray & | operator= (const CbcTreeArray &rhs) |
| virtual | ~CbcTreeArray () |
| virtual CbcTree * | 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 void | push (CbcNode *x) |
| Add a node to 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. | |
Search tree maintenance | |
| void | cleanTree (CbcModel *model, double cutoff, double &bestPossibleObjective) |
| Prune the tree using an objective function cutoff. | |
| virtual double | getBestPossibleObjective () |
| Get best possible objective function in the tree. | |
Protected Attributes | |
| CbcNode * | lastNode_ |
| Returns Last node. | |
| CbcNode * | lastNodePopped_ |
| Last node popped. | |
| int | switches_ |
| Not used yet. | |
Definition at line 152 of file CbcTree.hpp.
| CbcTreeArray::CbcTreeArray | ( | ) |
| CbcTreeArray::CbcTreeArray | ( | const CbcTreeArray & | rhs | ) |
| virtual CbcTreeArray::~CbcTreeArray | ( | ) | [virtual] |
| CbcTreeArray& CbcTreeArray::operator= | ( | const CbcTreeArray & | rhs | ) |
Reimplemented from CbcTree.
| virtual void CbcTreeArray::generateCpp | ( | FILE * | fp | ) | [inline, virtual] |
Create C++ lines to get to current state.
Reimplemented from CbcTree.
Definition at line 169 of file CbcTree.hpp.
| void CbcTreeArray::setComparison | ( | CbcCompareBase & | compare | ) |
Set comparison function and resort heap.
Reimplemented from CbcTree.
| virtual void CbcTreeArray::push | ( | CbcNode * | x | ) | [virtual] |
Add a node to the heap.
Reimplemented from CbcTree.
| virtual CbcNode* CbcTreeArray::bestNode | ( | double | cutoff | ) | [virtual] |
Gets best node and takes off heap.
Reimplemented from CbcTree.
| virtual bool CbcTreeArray::empty | ( | ) | [virtual] |
Test if empty *** note may be overridden.
Reimplemented from CbcTree.
| void CbcTreeArray::cleanTree | ( | CbcModel * | model, | |
| double | cutoff, | |||
| double & | bestPossibleObjective | |||
| ) | [virtual] |
| virtual double CbcTreeArray::getBestPossibleObjective | ( | ) | [virtual] |
CbcNode* CbcTreeArray::lastNode_ [protected] |
Returns Last node.
Definition at line 210 of file CbcTree.hpp.
CbcNode* CbcTreeArray::lastNodePopped_ [protected] |
Last node popped.
Definition at line 212 of file CbcTree.hpp.
int CbcTreeArray::switches_ [protected] |
Not used yet.
Definition at line 214 of file CbcTree.hpp.
1.6.1