Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

Loading...
Searching...
No Matches
ClusterKuratowskiConstraint.h
Go to the documentation of this file.
1
38#pragma once
39
43
45
46namespace ogdf {
47namespace cluster_planarity {
48
50public:
52
54
55 // Computes and returns the coefficient for the given variable
56 virtual double coeff(const abacus::Variable* v) const override;
57
58 void printMe(std::ostream& out) const {
59 out << "[KuraCon: ";
60 for (const NodePair& p : m_subdivision) {
61 out << p << ",";
62 }
63 out << "]";
64 }
65
66private:
67 // The subdivision containing edges forming a SubGraph that is not planar
69};
70
71}
72}
Declaration of the wrapper class of the Boyer-Myrvold planarity test.
Declaration of the variable class for the Branch&Cut algorithm for the Maximum C-Planar SubGraph prob...
Declaration of the master class for the Branch&Cut algorithm for the Maximum C-Planar SubGraph proble...
Forms the virtual base class for all possible constraints given in pool format.
Definition constraint.h:56
The master of the optimization.
Definition master.h:69
Forms the virtual base class for all possible variables given in pool format.
Definition variable.h:59
Doubly linked lists (maintaining the length of the list).
Definition List.h:1435
Singly linked lists.
Definition SList.h:179
ClusterKuratowskiConstraint(abacus::Master *master, int nEdges, SListPure< NodePair > &ks)
virtual double coeff(const abacus::Variable *v) const override
Returns the coefficient of the variable v in the constraint.
constraint.
static MultilevelBuilder * getDoubleFactoredZeroAdjustedMerger()
The namespace for all OGDF objects.