CbcNewTree Class Reference

#include <CbcTree.hpp>

Inheritance diagram for CbcNewTree:
CbcTree

List of all members.

Public Member Functions

 CbcNewTree ()
 CbcNewTree (const CbcNewTree &rhs)
CbcNewTreeoperator= (const CbcNewTree &rhs)
virtual ~CbcNewTree ()
virtual CbcNewTreeclone () const
 Clone.
virtual void generateCpp (FILE *)
 Create C++ lines to get to current state.
Heap access and maintenance methods

void setComparison (CbcCompareBase &compare)
 Set comparison function and resort heap.
virtual CbcNodetop () 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 CbcNodebestNode (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.
CbcNodeoperator[] (int i) const
 [] operator
CbcNodenodePointer (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.
CbcNodebestAlternate ()
 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 227 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  ) 
virtual CbcNewTree* CbcNewTree::clone (  )  const [virtual]

Clone.

Reimplemented from CbcTree.

virtual void CbcNewTree::generateCpp ( FILE *   )  [inline, virtual]

Create C++ lines to get to current state.

Reimplemented from CbcTree.

Definition at line 244 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]

Return size.

Reimplemented from CbcTree.

Definition at line 271 of file CbcTree.hpp.

CbcNode* CbcNewTree::operator[] ( int  i  )  const [inline]

[] operator

Reimplemented from CbcTree.

Definition at line 275 of file CbcTree.hpp.

CbcNode* CbcNewTree::nodePointer ( int  i  )  const [inline]

Return a node pointer.

Reimplemented from CbcTree.

Definition at line 279 of file CbcTree.hpp.

void CbcNewTree::cleanTree ( CbcModel model,
double  cutoff,
double &  bestPossibleObjective 
) [virtual]

Prune the tree using an objective function cutoff.

This routine removes all nodes with objective worst than the specified cutoff value. It also sets bestPossibleObjective to best of all on tree before deleting.

Reimplemented from CbcTree.

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 301 of file CbcTree.hpp.


The documentation for this class was generated from the following file:
Generated on Fri May 28 17:17:31 2010 by  doxygen 1.6.3