Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

Loading...
Searching...
No Matches
CPlanarEdgeVar.h
Go to the documentation of this file.
1
33#pragma once
34
35#include <ogdf/basic/Graph.h>
37
38#include <ostream>
39
40namespace abacus {
41class Master;
42} // namespace abacus
43
44namespace ogdf {
45namespace cluster_planarity {
46
47class CPlanarEdgeVar : public EdgeVar {
48 friend class MaxCPlanarSub;
49
50public:
51 CPlanarEdgeVar(abacus::Master* master, double obj, node source, node target)
52 : EdgeVar(master, obj, source, target) { }
53
54 CPlanarEdgeVar(abacus::Master* master, double obj, double lbound, node source, node target)
55 : EdgeVar(master, obj, lbound, source, target) { }
56
57 virtual ~CPlanarEdgeVar() { }
58
59 void printMe(std::ostream& out) override {
60 out << "[Var: " << sourceNode() << "->" << targetNode() << " ("
61 << "connect"
62 << ") ZF=" << obj() << "]";
63 }
64};
65
66}
67}
Declaration of the variable class for the Branch&Cut algorithm for the Maximum C-Planar SubGraph prob...
Includes declaration of graph class.
The master of the optimization.
Definition master.h:70
virtual double obj() const
Returns the objective function coefficient.
Definition variable.h:113
Class for the representation of nodes.
Definition Graph_d.h:241
CPlanarEdgeVar(abacus::Master *master, double obj, double lbound, node source, node target)
void printMe(std::ostream &out) override
CPlanarEdgeVar(abacus::Master *master, double obj, node source, node target)
The namespace for all OGDF objects.