Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

MinimalClusterConnection.h
Go to the documentation of this file.
1 
44 #pragma once
45 
48 
50 
51 namespace ogdf {
52 namespace cluster_planarity {
53 
55 public:
57 
58  virtual ~MinimalClusterConnection();
59 
60  // Computes and returns the coefficient for the given variable
61  virtual double coeff(const abacus::Variable* v) const override;
62 
63 private:
64  // The node pairs corresponding to the constraint
66 };
67 
68 }
69 }
ogdf
The namespace for all OGDF objects.
Definition: AugmentationModule.h:36
ogdf::cluster_planarity::MinimalClusterConnection
Definition: MinimalClusterConnection.h:54
constraint.h
constraint.
ogdf::cluster_planarity::MinimalClusterConnection::MinimalClusterConnection
MinimalClusterConnection(abacus::Master *master, List< NodePair > &edges)
ogdf::cluster_planarity::MinimalClusterConnection::coeff
virtual double coeff(const abacus::Variable *v) const override
Returns the coefficient of the variable v in the constraint.
ogdf::cluster_planarity::MinimalClusterConnection::m_edges
List< NodePair > m_edges
Definition: MinimalClusterConnection.h:65
EdgeVar.h
Declaration of the variable class for the Branch&Cut algorithm for the Maximum C-Planar SubGraph prob...
abacus::Variable
Forms the virtual base class for all possible variables given in pool format.
Definition: variable.h:59
MaxCPlanarMaster.h
Declaration of the master class for the Branch&Cut algorithm for the Maximum C-Planar SubGraph proble...
ogdf::List
Doubly linked lists (maintaining the length of the list).
Definition: List.h:42
ogdf::cluster_planarity::MinimalClusterConnection::~MinimalClusterConnection
virtual ~MinimalClusterConnection()
abacus::Constraint
Forms the virtual base class for all possible constraints given in pool format.
Definition: constraint.h:56
abacus::Master
The master of the optimization.
Definition: master.h:69