MAiNGO
babTree.h File Reference
#include "babException.h"
#include "babNode.h"
#include "babUtils.h"
#include <algorithm>
#include <cassert>
#include <limits>
#include <utility>

Go to the source code of this file.

Classes

struct  babBase::BranchingHistoryInfo
 Struct for collecting all information that must be saved about a node, so that after it is retrieved from the tree and processed, pseudocosts can be calculated. More...
 
class  babBase::BabNodeWithInfo
 This class represents an node in the B&B-Tree with additional information attached that is used in selecting nodes or branching variables. More...
 
class  babBase::BabTree
 Represents the B&B-Tree, manages the way nodes are saved and retrieved and pruned. More...
 
struct  babBase::NodePriorityComparator
 Functor for comparing node priorities. More...
 
struct  babBase::PruningScoreComparator
 Functor for comparing pruning scores. More...
 

Namespaces

 babBase
 namespace holding all essentials of the babBase submodule
 

Functions

std::vector< BabNodeWithInfo >::const_iterator babBase::select_node_highest_priority (const std::vector< BabNodeWithInfo > &nodeVectorIN)
 Returns the node with the highest priority. More...
 
std::vector< BabNodeWithInfo >::const_iterator babBase::select_node_breadthfirst (const std::vector< BabNodeWithInfo > &nodeVectorIN)
 Returns the node added least recently to the tree. More...
 
std::vector< BabNodeWithInfo >::const_iterator babBase::select_node_depthfirst (const std::vector< BabNodeWithInfo > &nodeVectorIN)
 Returns the node added most recently to the tree. More...