SubgraphUpwardPlanarizer.h

Go to the documentation of this file.

 
#pragma once
 
#include <ogdf/decomposition/BCTree.h>
#include <ogdf/layered/AcyclicSubgraphModule.h>
#include <ogdf/layered/GreedyCycleRemoval.h>
#include <ogdf/upward/FUPSModule.h>
#include <ogdf/upward/FUPSSimple.h>
#include <ogdf/upward/FixedEmbeddingUpwardEdgeInserter.h>
#include <ogdf/upward/UpwardEdgeInserterModule.h>
#include <ogdf/upward/UpwardPlanRep.h>
#include <ogdf/upward/UpwardPlanarizerModule.h>
 
#include <memory>
 
namespace ogdf {
 
class OGDF_EXPORT SubgraphUpwardPlanarizer : public UpwardPlanarizerModule {
public:
    SubgraphUpwardPlanarizer() {
        m_runs = 1;
        //set default module
        m_subgraph.reset(new FUPSSimple());
        m_inserter.reset(new FixedEmbeddingUpwardEdgeInserter());
        m_acyclicMod.reset(new GreedyCycleRemoval());
    }
 
    void setSubgraph(FUPSModule* FUPS) { m_subgraph.reset(FUPS); }
 
    void setInserter(UpwardEdgeInserterModule* pInserter) { m_inserter.reset(pInserter); }
 
    void setAcyclicSubgraphModule(AcyclicSubgraphModule* acyclicMod) {
        m_acyclicMod.reset(acyclicMod);
    }
 
    int runs() { return m_runs; }
 
    void runs(int n) { m_runs = n; }
 
protected:
    virtual ReturnType doCall(UpwardPlanRep& UPR, const EdgeArray<int>& cost,
            const EdgeArray<bool>& forbid) override;
 
    std::unique_ptr<FUPSModule> m_subgraph; 
    std::unique_ptr<UpwardEdgeInserterModule> m_inserter; 
    std::unique_ptr<AcyclicSubgraphModule> m_acyclicMod; 
    int m_runs;
 
private:
    void constructComponentGraphs(BCTree& BC, NodeArrayP<GraphCopy>& biComps);
 
    void dfsMerge(const GraphCopy& GC, BCTree& BC, NodeArrayP<GraphCopy>& biComps,
            NodeArrayP<UpwardPlanRep>& uprs, UpwardPlanRep& UPR_res, node parent_BC,
            node current_BC, NodeArray<bool>& nodesDone);
 
 
    void merge(const GraphCopy& GC, UpwardPlanRep& UPR_res, const GraphCopy& block,
            UpwardPlanRep& UPR);
};
 
}