ClusterKuratowskiConstraint.h

Go to the documentation of this file.

 
#pragma once
 
#include <ogdf/basic/Graph.h>
#include <ogdf/basic/List.h>
#include <ogdf/cluster/internal/EdgeVar.h>
#include <ogdf/cluster/internal/basics.h>
 
#include <ogdf/external/abacus.h>
 
#include <ostream>
 
namespace ogdf {
template<class E>
class SListPure;
 
namespace cluster_planarity {
 
class ClusterKuratowskiConstraint : public abacus::Constraint {
public:
    ClusterKuratowskiConstraint(abacus::Master* master, int nEdges, SListPure<NodePair>& ks);
 
    virtual ~ClusterKuratowskiConstraint();
 
    // Computes and returns the coefficient for the given variable
    virtual double coeff(const abacus::Variable* v) const override;
 
    void printMe(std::ostream& out) const {
        out << "[KuraCon: ";
        for (const NodePair& p : m_subdivision) {
            out << p << ",";
        }
        out << "]";
    }
 
private:
    // The subdivision containing edges forming a SubGraph that is not planar
    List<NodePair> m_subdivision;
};
 
}
}