Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

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