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_d.h>
40 
42 #include <ogdf/lib/abacus/master.h>
43 
44 namespace ogdf {
45 namespace cluster_planarity {
46 
47 class ChunkConnection;
48 
51 struct edgeValue {
54  double lpValue;
55  bool original;
57 };
58 
61 public:
63  double rhs, bool dynamic, bool local, bool liftable)
64  : abacus::Constraint(master, sub, sense, rhs, dynamic, local, liftable) { }
65 
66  virtual ~BaseConstraint() { }
67 
68  virtual int coeff(const NodePair& n) const = 0;
69  virtual double coeff(const abacus::Variable* v) const = 0;
70 };
71 
72 }
73 }
ogdf
The namespace for all OGDF objects.
Definition: AugmentationModule.h:36
abacus::ConVar::local
bool local() const
Returns true if the constraint/variable is only locally valid, false otherwise.
Definition: convar.h:113
ogdf::cluster_planarity::ChunkConnection
Definition: ChunkConnection.h:54
abacus::ConVar::sub
const Sub * sub() const
Returns a const pointer to the subproblem associated with the constraint/variable.
Definition: convar.h:199
constraint.h
constraint.
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:53
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:2101
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:62
abacus
Definition: abacusroot.h:48
ogdf::cluster_planarity::edgeValue::e
edge e
Definition: basics.h:56
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:51
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:66
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:52
ogdf::cluster_planarity::BaseConstraint
Basic constraint type.
Definition: basics.h:60
master.h
the master of the optimization.
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:54
ClusterGraphAttributes.h
Declares ClusterGraphAttributes, an extension of class GraphAttributes, to store clustergraph layout ...
ogdf::EdgeElement
Class for the representation of edges.
Definition: Graph_d.h:356
ClusterGraph.h
Derived class of GraphObserver providing additional functionality to handle clustered graphs.
Graph_d.h
Pure declaration header, find template implementation in Graph.h.
ogdf::cluster_planarity::BaseConstraint::coeff
virtual int coeff(const NodePair &n) const =0
ogdf::cluster_planarity::edgeValue::original
bool original
Definition: basics.h:55
ogdf::NodeElement
Class for the representation of nodes.
Definition: Graph_d.h:233
abacus::CSense::SENSE
SENSE
Definition: csense.h:51
abacus::Master
The master of the optimization.
Definition: master.h:69