BALL
1.4.1
|
#include <BALL/STRUCTURE/BONDORDERS/branchAndBoundBondOrderStrategy.h>
Classes | |
struct | Default |
struct | Option |
Option names. More... | |
Public Member Functions | |
BranchAndBoundBondOrderStrategy (AssignBondOrderProcessor *parent) | |
virtual | ~BranchAndBoundBondOrderStrategy () |
virtual void | clear () |
virtual void | init () |
virtual bool | readOptions (const Options &options) |
virtual void | setDefaultOptions () |
virtual boost::shared_ptr < BondOrderAssignment > | computeNextSolution () |
Branch-and-bound algorithm for bond order assignment.
This class implements a (possibly sub-optimal) branch and bound approach for the bond order assignment problem that can be used by the AssignBondOrderProcessor . The implementation of this strategy is very similar to the KGreedy approach and much of its functionality can be reused. We thus derive from KGreedyBondOrderStrategy .
Definition at line 28 of file branchAndBoundBondOrderStrategy.h.
BALL::BranchAndBoundBondOrderStrategy::BranchAndBoundBondOrderStrategy | ( | AssignBondOrderProcessor * | parent | ) |
virtual BALL::BranchAndBoundBondOrderStrategy::~BranchAndBoundBondOrderStrategy | ( | ) | [virtual] |
virtual void BALL::BranchAndBoundBondOrderStrategy::clear | ( | ) | [virtual] |
Reimplemented from BALL::KGreedyBondOrderStrategy.
virtual boost::shared_ptr<BondOrderAssignment> BALL::BranchAndBoundBondOrderStrategy::computeNextSolution | ( | ) | [virtual] |
Reimplemented from BALL::KGreedyBondOrderStrategy.
virtual void BALL::BranchAndBoundBondOrderStrategy::init | ( | ) | [virtual] |
Reimplemented from BALL::KGreedyBondOrderStrategy.
virtual bool BALL::BranchAndBoundBondOrderStrategy::readOptions | ( | const Options & | options | ) | [virtual] |
Reimplemented from BALL::KGreedyBondOrderStrategy.
virtual void BALL::BranchAndBoundBondOrderStrategy::setDefaultOptions | ( | ) | [virtual] |
Reimplemented from BALL::KGreedyBondOrderStrategy.