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