PlanarAugmentationFix.h

Go to the documentation of this file.

 
#pragma once
 
#include <ogdf/basic/Graph.h>
#include <ogdf/basic/GraphCopy.h>
#include <ogdf/basic/List.h>
#include <ogdf/basic/basic.h>
#include <ogdf/augmentation/AugmentationModule.h>
#include <ogdf/augmentation/planar/PALabel.h>
 
namespace ogdf {
class CombinatorialEmbedding;
class DynamicBCTree;
 
class OGDF_EXPORT PlanarAugmentationFix : public AugmentationModule {
public:
    PlanarAugmentationFix() { }
 
    ~PlanarAugmentationFix() { }
 
protected:
    virtual void doCall(Graph& g, List<edge>& list) override;
 
private:
    CombinatorialEmbedding* m_pEmbedding = nullptr;
 
    CombinatorialEmbedding* m_pActEmbedding = nullptr;
 
    Graph* m_pGraph = nullptr;
 
    List<edge>* m_pResult = nullptr;
 
    DynamicBCTree* m_pBCTree = nullptr;
 
    GraphCopy m_graphCopy;
 
    EdgeArray<edge> m_eCopy;
 
    List<pa_label> m_labels;
 
    NodeArray<ListIterator<pa_label>> m_isLabel;
 
    NodeArray<pa_label> m_belongsTo;
 
    NodeArray<ListIterator<node>> m_belongsToIt;
 
    node m_actBCRoot;
 
    void augment(adjEntry adjOuterFace);
 
    void modifyBCRoot(node oldRoot, node newRoot);
 
    void changeBCRoot(node oldRoot, node newRoot);
 
    void reduceChain(node pendant);
 
    PALabel::StopCause followPath(node v, node& last);
 
    bool findMatching(node& pendant1, node& pendant2, adjEntry& v1, adjEntry& v2);
 
    void findMatchingRev(node& pendant1, node& pendant2, adjEntry& v1, adjEntry& v2);
 
    pa_label newLabel(node cutvertex, node parent, node pendant, PALabel::StopCause whyStop);
 
    void addPendant(node pendant, pa_label& label);
 
    ListIterator<pa_label> insertLabel(pa_label label);
 
    void connectPendants(node pendant1, node pendant2, adjEntry adjV1, adjEntry adjV2);
 
    void connectSingleLabel();
 
    void deletePendant(node pendant);
 
    void deleteLabel(pa_label& label);
 
    void removeLabel(pa_label& label);
};
 
}