VarEdgeInserterDynCore.h

Go to the documentation of this file.

 
#pragma once
 
#include <ogdf/basic/Array.h>
#include <ogdf/basic/Graph.h>
#include <ogdf/basic/Module.h>
#include <ogdf/basic/Timeouter.h>
#include <ogdf/basic/basic.h>
#include <ogdf/planarity/PlanRepLight.h>
 
#include <cstdint>
 
namespace ogdf {
enum class RemoveReinsertType;
template<class E>
class List;
template<class E>
class SList;
 
class OGDF_EXPORT VarEdgeInserterDynCore : public Timeouter {
public:
    VarEdgeInserterDynCore(PlanRepLight& pr, const EdgeArray<int>* pCostOrig,
            const EdgeArray<bool>* pForbiddenOrig, const EdgeArray<uint32_t>* pEdgeSubgraphs)
        : m_pr(pr), m_pCost(pCostOrig), m_pForbidden(pForbiddenOrig), m_pSubgraph(pEdgeSubgraphs) { }
 
    virtual ~VarEdgeInserterDynCore() { }
 
    Module::ReturnType call(const Array<edge>& origEdges, RemoveReinsertType rrPost,
            double percentMostCrossed);
 
    int runsPostprocessing() const { return m_runsPostprocessing; }
 
protected:
    class BCandSPQRtrees;
    class ExpandedGraph;
 
    int costCrossed(edge eOrig) const;
 
    void insert(edge eOrig, SList<adjEntry>& eip);
    void blockInsert(node s, node t, List<adjEntry>& L);
 
    virtual void storeTypeOfCurrentEdge(edge eOrig) { }
 
    virtual BCandSPQRtrees* createBCandSPQRtrees();
    virtual ExpandedGraph* createExpandedGraph(BCandSPQRtrees& BC);
 
    virtual void buildSubpath(node v, node vPred, node vSucc, List<adjEntry>& L, ExpandedGraph& Exp,
            node s, node t);
 
    static const int c_bigM = 10000;
    PlanRepLight& m_pr;
 
    const EdgeArray<int>* m_pCost;
    const EdgeArray<bool>* m_pForbidden;
    const EdgeArray<uint32_t>* m_pSubgraph;
 
    BCandSPQRtrees* m_pBC;
 
    int m_runsPostprocessing; 
};
 
class VarEdgeInserterDynUMLCore : public VarEdgeInserterDynCore {
public:
    VarEdgeInserterDynUMLCore(PlanRepLight& pr, const EdgeArray<int>* pCostOrig,
            const EdgeArray<uint32_t>* pEdgeSubgraph)
        : VarEdgeInserterDynCore(pr, pCostOrig, nullptr, pEdgeSubgraph) { }
 
protected:
    class BCandSPQRtreesUML;
    class ExpandedGraphUML;
 
    void storeTypeOfCurrentEdge(edge eOrig) override { m_typeOfCurrentEdge = m_pr.typeOrig(eOrig); }
 
    virtual BCandSPQRtrees* createBCandSPQRtrees() override;
    virtual ExpandedGraph* createExpandedGraph(BCandSPQRtrees& BC) override;
    virtual void buildSubpath(node v, node vPred, node vSucc, List<adjEntry>& L, ExpandedGraph& Exp,
            node s, node t) override;
 
    Graph::EdgeType m_typeOfCurrentEdge;
};
 
 
}