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
46#include <ogdf/basic/List.h>
49
51
52namespace ogdf {
53struct NodePair;
54
55namespace cluster_planarity {
56
58public:
60
62
63 // Computes and returns the coefficient for the given variable
64 virtual double coeff(const abacus::Variable* v) const override;
65
66private:
67 // The node pairs corresponding to the constraint
69};
70
71}
72}
Declaration of the variable class for the Branch&Cut algorithm for the Maximum C-Planar SubGraph prob...
Declaration of doubly linked lists and iterators.
Declaration of the master class for the Branch&Cut algorithm for the Maximum C-Planar SubGraph proble...
Includes Abacus.
Forms the virtual base class for all possible constraints given in pool format.
Definition constraint.h:57
The master of the optimization.
Definition master.h:70
Forms the virtual base class for all possible variables given in pool format.
Definition variable.h:60
Doubly linked lists (maintaining the length of the list).
Definition List.h:1451
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)
The namespace for all OGDF objects.