Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

ClusterKuratowskiConstraint.h
Go to the documentation of this file.
1 
38 #pragma once
39 
43 
45 
46 namespace ogdf {
47 namespace cluster_planarity {
48 
50 public:
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 
66 private:
67  // The subdivision containing edges forming a SubGraph that is not planar
69 };
70 
71 }
72 }
ogdf
The namespace for all OGDF objects.
Definition: AugmentationModule.h:36
BoyerMyrvold.h
Declaration of the wrapper class of the Boyer-Myrvold planarity test.
constraint.h
constraint.
ogdf::NodePair
Definition: Graph_d.h:2101
ogdf::cluster_planarity::ClusterKuratowskiConstraint::ClusterKuratowskiConstraint
ClusterKuratowskiConstraint(abacus::Master *master, int nEdges, SListPure< NodePair > &ks)
ogdf::cluster_planarity::ClusterKuratowskiConstraint
Definition: ClusterKuratowskiConstraint.h:49
EdgeVar.h
Declaration of the variable class for the Branch&Cut algorithm for the Maximum C-Planar SubGraph prob...
ogdf::cluster_planarity::ClusterKuratowskiConstraint::~ClusterKuratowskiConstraint
virtual ~ClusterKuratowskiConstraint()
ogdf::cluster_planarity::ClusterKuratowskiConstraint::coeff
virtual double coeff(const abacus::Variable *v) const override
Returns the coefficient of the variable v in the constraint.
ogdf::SListPure
Singly linked lists.
Definition: SList.h:39
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: List.h:42
ogdf::cluster_planarity::ClusterKuratowskiConstraint::printMe
void printMe(std::ostream &out) const
Definition: ClusterKuratowskiConstraint.h:58
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...
ogdf::cluster_planarity::ClusterKuratowskiConstraint::m_subdivision
List< NodePair > m_subdivision
Definition: ClusterKuratowskiConstraint.h:68
abacus::Master
The master of the optimization.
Definition: master.h:69