Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

MaxPlanarEdgesConstraint.h
Go to the documentation of this file.
1 
39 #pragma once
40 
41 #include <ogdf/basic/List.h>
44 
45 #include <ogdf/external/abacus.h>
46 
47 namespace ogdf {
48 struct NodePair;
49 
50 namespace cluster_planarity {
51 
53 #ifdef OGDF_DEBUG
54  friend class MaxCPlanarSub;
55  friend class CPlanarSub;
56 #endif
57 public:
58  //construction
59  MaxPlanarEdgesConstraint(abacus::Master* master, int edgeBound, List<NodePair>& edges);
60  MaxPlanarEdgesConstraint(abacus::Master* master, int edgeBound);
61 
62  //destruction
63  virtual ~MaxPlanarEdgesConstraint();
64 
65  //computes and returns the coefficient for the given variable
66  virtual double coeff(const abacus::Variable* v) const override;
67 
68 private:
71 };
72 
73 }
74 }
ogdf
The namespace for all OGDF objects.
Definition: multilevelmixer.cpp:39
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:60
abacus.h
Includes Abacus.
ogdf::cluster_planarity::MaxPlanarEdgesConstraint::CPlanarSub
friend class CPlanarSub
Definition: MaxPlanarEdgesConstraint.h:55
ogdf::cluster_planarity::MaxPlanarEdgesConstraint
Definition: MaxPlanarEdgesConstraint.h:52
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: DfsMakeBiconnected.h:40
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...
List.h
Declaration of doubly linked lists and iterators.
ogdf::cluster_planarity::MaxPlanarEdgesConstraint::m_edges
List< NodePair > m_edges
Definition: MaxPlanarEdgesConstraint.h:69
ogdf::cluster_planarity::MaxPlanarEdgesConstraint::m_graphCons
bool m_graphCons
Definition: MaxPlanarEdgesConstraint.h:70
abacus::Master
The master of the optimization.
Definition: master.h:69