|
Open Graph Drawing Framework |
v. 2023.09 (Elderberry)
|
|
|
The namespace for all OGDF objects.
Includes declaration of graph class.
const Sub * sub() const
Returns a const pointer to the subproblem associated with the constraint/variable.
List< NodePair > m_cutEdges
void printMe(std::ostream &out) const
Declaration of the variable class for the Branch&Cut algorithm for the Maximum C-Planar SubGraph prob...
CutConstraint(abacus::Master *master, abacus::Sub *sub, List< NodePair > &edges)
Forms the virtual base class for all possible variables given in pool format.
Doubly linked lists (maintaining the length of the list).
int coeff(const NodePair &n) const override
Declaration of the master class for the Branch&Cut algorithm for the Maximum C-Planar SubGraph proble...
Declaration of doubly linked lists and iterators.
Class for the representation of nodes.
virtual double coeff(const abacus::Variable *v) const override
Returns the coefficient of the variable v in the constraint.
The master of the optimization.