BoyerMyrvold.h

Go to the documentation of this file.

 
#pragma once
 
#include <ogdf/basic/Graph.h>
#include <ogdf/basic/GraphCopy.h>
#include <ogdf/basic/SList.h>
#include <ogdf/basic/basic.h>
#include <ogdf/planarity/ExtractKuratowskis.h>
#include <ogdf/planarity/PlanarityModule.h>
#include <ogdf/planarity/boyer_myrvold/BoyerMyrvoldPlanar.h>
 
namespace ogdf {
class KuratowskiSubdivision;
 
 
class OGDF_EXPORT BoyerMyrvold : public PlanarityModule {
protected:
    BoyerMyrvoldPlanar* pBMP;
 
    void clear() {
        delete pBMP;
        pBMP = nullptr;
    }
 
    int nOfStructures;
 
public:
    BoyerMyrvold() {
        pBMP = nullptr;
        nOfStructures = 0;
    }
 
    ~BoyerMyrvold() { clear(); }
 
    int numberOfStructures() { return nOfStructures; }
 
 
    virtual bool isPlanarDestructive(Graph& g) override;
 
 
    virtual bool isPlanar(const Graph& g) override;
 
    virtual bool planarEmbed(Graph& G) override {
        SList<KuratowskiWrapper> list;
        return planarEmbed(G, list);
    }
 
 
    virtual bool planarEmbedPlanarGraph(Graph& G) override {
        SList<KuratowskiWrapper> list;
        return planarEmbedDestructive(G, list);
    }
 
    void transform(const KuratowskiWrapper& source, KuratowskiSubdivision& target,
            NodeArray<int>& count, EdgeArray<int>& countEdge);
 
 
    void transform(const SList<KuratowskiWrapper>& sourceList,
            SList<KuratowskiSubdivision>& targetList, const Graph& g,
            const bool onlyDifferent = false);
 
 
    void transform(const SList<KuratowskiWrapper>& sourceList,
            SList<KuratowskiSubdivision>& targetList, const GraphCopySimple& h,
            const bool onlyDifferent = false) {
        transform(sourceList, targetList, h.original(), onlyDifferent);
    }
 
 
    bool planarEmbedDestructive(Graph& g, SList<KuratowskiWrapper>& output, int embeddingGrade,
            bool bundles = false, bool limitStructures = false, bool randomDFSTree = false,
            bool avoidE2Minors = true);
 
    bool planarEmbedDestructive(Graph& g, SList<KuratowskiWrapper>& output,
            BoyerMyrvoldPlanar::EmbeddingGrade embeddingGrade =
                    BoyerMyrvoldPlanar::EmbeddingGrade::doNotFind,
            bool bundles = false, bool limitStructures = false, bool randomDFSTree = false,
            bool avoidE2Minors = true) {
        return planarEmbedDestructive(g, output, static_cast<int>(embeddingGrade), bundles,
                limitStructures, randomDFSTree, avoidE2Minors);
    }
 
 
    bool planarEmbed(Graph& g, SList<KuratowskiWrapper>& output, int embeddingGrade,
            bool bundles = false, bool limitStructures = false, bool randomDFSTree = false,
            bool avoidE2Minors = true);
 
    bool planarEmbed(Graph& g, SList<KuratowskiWrapper>& output,
            BoyerMyrvoldPlanar::EmbeddingGrade embeddingGrade =
                    BoyerMyrvoldPlanar::EmbeddingGrade::doNotFind,
            bool bundles = false, bool limitStructures = false, bool randomDFSTree = false,
            bool avoidE2Minors = true) {
        return planarEmbed(g, output, static_cast<int>(embeddingGrade), bundles, limitStructures,
                randomDFSTree, avoidE2Minors);
    }
 
 
    bool planarEmbed(GraphCopySimple& h, SList<KuratowskiWrapper>& output, int embeddingGrade,
            bool bundles = false, bool limitStructures = false, bool randomDFSTree = false,
            bool avoidE2Minors = true);
 
    bool planarEmbed(GraphCopySimple& h, SList<KuratowskiWrapper>& output,
            BoyerMyrvoldPlanar::EmbeddingGrade embeddingGrade =
                    BoyerMyrvoldPlanar::EmbeddingGrade::doNotFind,
            bool bundles = false, bool limitStructures = false, bool randomDFSTree = false,
            bool avoidE2Minors = true) {
        return planarEmbed(h, output, static_cast<int>(embeddingGrade), bundles, limitStructures,
                randomDFSTree, avoidE2Minors);
    }
};
 
}