Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

Loading...
Searching...
No Matches
MaxPlanarEdgesConstraint.h
Go to the documentation of this file.
1
39#pragma once
40
43
45
46namespace ogdf {
47namespace cluster_planarity {
48
50#ifdef OGDF_DEBUG
51 friend class MaxCPlanarSub;
52 friend class CPlanarSub;
53#endif
54public:
55 //construction
58
59 //destruction
61
62 //computes and returns the coefficient for the given variable
63 virtual double coeff(const abacus::Variable* v) const override;
64
65private:
68};
69
70}
71}
Declaration of the variable class for the Branch&Cut algorithm for the Maximum C-Planar SubGraph prob...
Declaration of the master class for the Branch&Cut algorithm for the Maximum C-Planar SubGraph proble...
Forms the virtual base class for all possible constraints given in pool format.
Definition constraint.h:56
The master of the optimization.
Definition master.h:69
Forms the virtual base class for all possible variables given in pool format.
Definition variable.h:59
Doubly linked lists (maintaining the length of the list).
Definition List.h:1435
virtual double coeff(const abacus::Variable *v) const override
Returns the coefficient of the variable v in the constraint.
MaxPlanarEdgesConstraint(abacus::Master *master, int edgeBound)
MaxPlanarEdgesConstraint(abacus::Master *master, int edgeBound, List< NodePair > &edges)
constraint.
static MultilevelBuilder * getDoubleFactoredZeroAdjustedMerger()
The namespace for all OGDF objects.