|
Open Graph Drawing Framework |
v. 2023.09 (Elderberry)
|
|
|
Go to the documentation of this file.
57 template<
class E,
class INDEX>
60 namespace cluster_planarity {
90 out <<
"[ChunkCon: (";
An array that keeps track of the number of inserted elements; also usable as an efficient stack.
The namespace for all OGDF objects.
Includes declaration of graph class.
ChunkConnection(abacus::Master *master, const ArrayBuffer< node > &chunk, const ArrayBuffer< node > &cochunk)
Contains logging functionality.
Declaration of the variable class for the Branch&Cut algorithm for the Maximum C-Planar SubGraph prob...
Forms the virtual base class for all possible variables given in pool format.
void printMe(std::ostream &out) const
Declaration and implementation of Array class and Array algorithms.
int coeff(const NodePair &n) const override
friend class CPlanarMaster
EdgeType theEdgeType() const
Declaration of the master class for the Branch&Cut algorithm for the Maximum C-Planar SubGraph proble...
virtual ~ChunkConnection()
Class for the representation of nodes.
static std::ostream & slout(Level level=Level::Default)
stream for logging-output (global)
The master of the optimization.
virtual double coeff(const abacus::Variable *v) const override
Returns the coefficient of the variable v in the constraint.