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
41#include <ogdf/basic/List.h>
44
46
47namespace ogdf {
48struct NodePair;
49
50namespace cluster_planarity {
51
53#ifdef OGDF_DEBUG
54 friend class MaxCPlanarSub;
55 friend class CPlanarSub;
56#endif
57public:
58 //construction
61
62 //destruction
64
65 //computes and returns the coefficient for the given variable
66 virtual double coeff(const abacus::Variable* v) const override;
67
68private:
71};
72
73}
74}
Declaration of the variable class for the Branch&Cut algorithm for the Maximum C-Planar SubGraph prob...
Declaration of doubly linked lists and iterators.
Includes Abacus.
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:57
The master of the optimization.
Definition master.h:70
Forms the virtual base class for all possible variables given in pool format.
Definition variable.h:60
Doubly linked lists (maintaining the length of the list).
Definition List.h:1451
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)
The namespace for all OGDF objects.