PlanarizerChordlessCycle.h

Go to the documentation of this file.

 
#pragma once
 
#include <ogdf/basic/DualGraph.h>
#include <ogdf/basic/Graph.h>
#include <ogdf/basic/basic.h>
#include <ogdf/planarity/CrossingMinimizationModule.h>
#include <ogdf/planarity/StarInserter.h>
 
#include <cstdint>
 
namespace ogdf {
class GraphCopy;
class PlanRep;
template<class E>
class List;
 
class OGDF_EXPORT PlanarizerChordlessCycle : 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;
 
public:
    PlanarizerChordlessCycle();
 
    PlanarizerChordlessCycle(const PlanarizerChordlessCycle& planarizer);
 
    virtual CrossingMinimizationModule* clone() const override;
 
    PlanarizerChordlessCycle& operator=(const PlanarizerChordlessCycle& planarizer);
 
private:
    bool findChordlessCycle(const Graph& G, List<node>& cycle);
 
    void transferToPlanRep(PlanRep& pr, const GraphCopy& graphCopy, const GraphCopy& copyCopy);
 
    void addToGraphCopy(GraphCopy& graphCopy, GraphCopy& copyCopy, DynamicDualGraph& dual,
            node vOrig, const EdgeArray<int>* pCostOrig, EdgeArray<int>* pCostCopy);
 
    StarInserter m_inserter;
};
 
}