Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

Loading...
Searching...
No Matches
MinimalClusterConnection.h
Go to the documentation of this file.
1
44#pragma once
45
48
50
51namespace ogdf {
52namespace cluster_planarity {
53
55public:
57
59
60 // Computes and returns the coefficient for the given variable
61 virtual double coeff(const abacus::Variable* v) const override;
62
63private:
64 // The node pairs corresponding to the constraint
66};
67
68}
69}
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
virtual double coeff(const abacus::Variable *v) const override
Returns the coefficient of the variable v in the constraint.
MinimalClusterConnection(abacus::Master *master, List< NodePair > &edges)
constraint.
The namespace for all OGDF objects.