PlanarizerMixedInsertion.h

Go to the documentation of this file.

 
#pragma once
 
#include <ogdf/basic/Graph.h>
#include <ogdf/basic/basic.h>
#include <ogdf/planarity/CrossingMinimizationModule.h>
#include <ogdf/planarity/PlanarSubgraphModule.h>
 
#include <cstdint>
#include <memory>
 
namespace ogdf {
class PlanRep;
 
class OGDF_EXPORT PlanarizerMixedInsertion : public CrossingMinimizationModule {
protected:
 
    virtual ReturnType doCall(PlanRep& pr, int cc, const EdgeArray<int>* pCostOrig,
            const EdgeArray<bool>* pForbiddenOrig, const EdgeArray<uint32_t>* pEdgeSubGraphs,
            int& crossingNumber) override;
    // (The algorithm may still work when pr is not simple and the checking
    // assertion is removed as long as only edge insertion is used.)
 
public:
    enum class NodeSelectionMethod {
        Random, 
        HigherDegree, 
        LowerDegree, 
        HigherNonPlanarDegree, 
        LowerNonPlanarDegree, 
        BothEndpoints 
    };
 
    PlanarizerMixedInsertion();
 
    PlanarizerMixedInsertion(const PlanarizerMixedInsertion& planarizer);
 
    virtual CrossingMinimizationModule* clone() const override;
 
    PlanarizerMixedInsertion& operator=(const PlanarizerMixedInsertion& planarizer);
 
    void setSubgraph(PlanarSubgraphModule<int>* pSubgraph) { m_subgraph.reset(pSubgraph); }
 
    NodeSelectionMethod nodeSelectionMethod() { return m_nodeSelectionMethod; }
 
    void nodeSelectionMethod(NodeSelectionMethod method) { m_nodeSelectionMethod = method; }
 
private:
    std::unique_ptr<PlanarSubgraphModule<int>> m_subgraph;
 
    NodeSelectionMethod m_nodeSelectionMethod;
};
 
}