Ignore:
Timestamp:
Mar 16, 2009 6:30:25 AM (11 years ago)
Author:
forrest
Message:

chnages to try and make faster

File:
1 edited

Legend:

Unmodified
Added
Removed
  • trunk/Cbc/src/CbcTree.hpp

    r940 r1132  
    144144  int * newBound_;
    145145};
     146/*! \class tree
     147    \brief Implementation of live set as a managed array.
     148
     149    This class is used to hold the set of live nodes in the search tree.
     150*/
     151
     152class CbcTreeArray : public CbcTree {
     153
     154public:
     155
     156  // Default Constructor
     157  CbcTreeArray ();
     158
     159  // Copy constructor
     160  CbcTreeArray ( const CbcTreeArray & rhs);
     161  // = operator
     162  CbcTreeArray & operator=(const CbcTreeArray & rhs);
     163   
     164  virtual ~CbcTreeArray();
     165
     166  /// Clone
     167  virtual CbcTree * clone() const;
     168  /// Create C++ lines to get to current state
     169  virtual void generateCpp( FILE * fp) {}
     170
     171/*! \name Heap access and maintenance methods */
     172//@{
     173
     174  /// Set comparison function and resort heap
     175  void setComparison(CbcCompareBase  &compare);
     176
     177  /// Add a node to the heap
     178  virtual void push(CbcNode * x);
     179
     180  /// Gets best node and takes off heap
     181  virtual CbcNode * bestNode(double cutoff);
     182
     183//@}
     184/*! \name vector methods */
     185//@{
     186
     187  /// Test if empty *** note may be overridden
     188  virtual bool empty() ;
     189
     190//@}
     191
     192/*! \name Search tree maintenance */
     193//@{
     194
     195/*! \brief Prune the tree using an objective function cutoff
     196
     197  This routine removes all nodes with objective worst than the
     198  specified cutoff value.
     199  It also sets bestPossibleObjective to best
     200  of all on tree before deleting.
     201*/
     202
     203  void cleanTree(CbcModel * model, double cutoff, double & bestPossibleObjective);
     204  /// Get best possible objective function in the tree
     205  virtual double getBestPossibleObjective();
     206//@}
     207protected:
     208  /// Returns
     209  /// Last node
     210  CbcNode * lastNode_;
     211  /// Last node popped
     212  CbcNode * lastNodePopped_;
     213  /// Not used yet
     214  int switches_;
     215
     216};
    146217
    147218/// New style
Note: See TracChangeset for help on using the changeset viewer.