Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

basics.h
Go to the documentation of this file.
1 
35 #pragma once
36 
37 #include <ogdf/basic/Graph.h>
38 
39 #include <ogdf/external/abacus.h>
40 
41 namespace ogdf {
42 namespace cluster_planarity {
43 
44 
47 struct edgeValue {
50  double lpValue;
51  bool original;
53 };
54 
57 public:
59  double rhs, bool dynamic, bool local, bool liftable)
60  : abacus::Constraint(master, sub, sense, rhs, dynamic, local, liftable) { }
61 
62  virtual ~BaseConstraint() { }
63 
64  virtual int coeff(const NodePair& n) const = 0;
65  virtual double coeff(const abacus::Variable* v) const = 0;
66 };
67 
68 }
69 }
ogdf
The namespace for all OGDF objects.
Definition: multilevelmixer.cpp:39
abacus::ConVar::local
bool local() const
Returns true if the constraint/variable is only locally valid, false otherwise.
Definition: convar.h:113
Graph.h
Includes declaration of graph class.
abacus.h
Includes Abacus.
abacus::ConVar::sub
const Sub * sub() const
Returns a const pointer to the subproblem associated with the constraint/variable.
Definition: convar.h:199
abacus::Constraint::rhs
virtual double rhs() const
Returns the right hand side of the constraint.
Definition: constraint.h:130
ogdf::cluster_planarity::edgeValue::trg
node trg
Definition: basics.h:49
abacus::Constraint::Constraint
Constraint(Master *master, const Sub *sub, CSense::SENSE sense, double rhs, bool dynamic, bool local, bool liftable)
Initializes a constraint.
Definition: constraint.h:288
ogdf::NodePair
Definition: Graph_d.h:2109
ogdf::cluster_planarity::BaseConstraint::BaseConstraint
BaseConstraint(abacus::Master *master, const abacus::Sub *sub, abacus::CSense::SENSE sense, double rhs, bool dynamic, bool local, bool liftable)
Definition: basics.h:58
abacus
Definition: ILPClusterPlanarity.h:50
ogdf::cluster_planarity::edgeValue::e
edge e
Definition: basics.h:52
abacus::Constraint::liftable
bool liftable() const
Checks if the constraint is liftable.
Definition: constraint.h:140
abacus::ConVar::dynamic
virtual bool dynamic() const
Return true if the constraint/variable is dynamic.
Definition: convar.h:124
ogdf::cluster_planarity::edgeValue
Struct for attaching the current lp-value to the corresponding edge. Used in the primal heuristic.
Definition: basics.h:47
abacus::Variable
Forms the virtual base class for all possible variables given in pool format.
Definition: variable.h:59
ogdf::cluster_planarity::BaseConstraint::~BaseConstraint
virtual ~BaseConstraint()
Definition: basics.h:62
abacus::Constraint::sense
CSense * sense()
Returns a pointer to the sense of the constraint.
Definition: constraint.h:115
ogdf::cluster_planarity::edgeValue::src
node src
Definition: basics.h:48
ogdf::cluster_planarity::BaseConstraint
Basic constraint type.
Definition: basics.h:56
abacus::Sub
The subproblem.
Definition: sub.h:68
abacus::Constraint
Forms the virtual base class for all possible constraints given in pool format.
Definition: constraint.h:56
ogdf::cluster_planarity::edgeValue::lpValue
double lpValue
Definition: basics.h:50
ogdf::EdgeElement
Class for the representation of edges.
Definition: Graph_d.h:363
ogdf::cluster_planarity::BaseConstraint::coeff
virtual int coeff(const NodePair &n) const =0
ogdf::cluster_planarity::edgeValue::original
bool original
Definition: basics.h:51
ogdf::NodeElement
Class for the representation of nodes.
Definition: Graph_d.h:240
abacus::CSense::SENSE
SENSE
Definition: csense.h:51
abacus::Master
The master of the optimization.
Definition: master.h:69