Open
Graph Drawing
Framework

#pragma once


#include <ogdf/basic/Array.h>

#include <ogdf/basic/Graph.h>

#include <ogdf/basic/SList.h>

#include <ogdf/basic/basic.h>

#include <ogdf/planarity/boyer_myrvold/FindKuratowskis.h>


#include <iosfwd>


namespace ogdf {

class BoyerMyrvoldPlanar;


class OGDF_EXPORT KuratowskiWrapper {

public:

    KuratowskiWrapper() { }


    inline bool isK33() const { return subdivisionType != SubdivisionType::E5; }


    inline bool isK5() const { return subdivisionType == SubdivisionType::E5; }


    enum class SubdivisionType {

        A = 0,

        AB = 1,

        AC = 2,

        AD = 3,

        AE1 = 4,

        AE2 = 5,

        AE3 = 6,

        AE4 = 7,

        B = 8,

        C = 9,

        D = 10,

        E1 = 11,

        E2 = 12,

        E3 = 13,

        E4 = 14,

        E5 = 15

    };


    SubdivisionType subdivisionType;


    node V;


    SListPure<edge> edgeList;

};


OGDF_EXPORT std::ostream& operator<<(std::ostream& os, const KuratowskiWrapper::SubdivisionType& obj);


class ExtractKuratowskis {

public:

    explicit ExtractKuratowskis(BoyerMyrvoldPlanar& bm);


    ~ExtractKuratowskis() { }


    void extract(const SListPure<KuratowskiStructure>& allKuratowskis,

            SList<KuratowskiWrapper>& output);


    void extractBundles(const SListPure<KuratowskiStructure>& allKuratowskis,

            SList<KuratowskiWrapper>& output);


    enum class KuratowskiType {

        none = 0,

        K33 = 1,

        K5 = 2

    };


    static KuratowskiType whichKuratowski(const Graph& m_g, const NodeArray<int>& dfi,

            const SListPure<edge>& list);


    static KuratowskiType whichKuratowskiArray(const Graph& g,

#if 0

            const NodeArray<int>& m_dfi,

#endif

            EdgeArray<int>& edgenumber);


    static bool isANewKuratowski(const Graph& g, const SListPure<edge>& kuratowski,

            const SList<KuratowskiWrapper>& output);


    static bool isANewKuratowski(

#if 0

            const Graph& g,

#endif

            const EdgeArray<int>& test, const SList<KuratowskiWrapper>& output);


    // avoid automatic creation of assignment operator

    ExtractKuratowskis& operator=(const ExtractKuratowskis&);


protected:

    BoyerMyrvoldPlanar& BMP;


    const Graph& m_g;


    int m_embeddingGrade;

    const bool m_avoidE2Minors;


    int m_nodeMarker;

    NodeArray<int> m_wasHere;


    const NodeArray<int>& m_dfi;


    const Array<node>& m_nodeFromDFI;


    const NodeArray<adjEntry>& m_adjParent;


    inline void addExternalFacePath(SListPure<edge>& list, const SListPure<adjEntry>& externPath) {

        SListConstIterator<adjEntry> itExtern;

        for (itExtern = externPath.begin(); itExtern.valid(); ++itExtern) {

            list.pushBack((*itExtern)->theEdge());

        }

    }


    inline adjEntry adjToLowestNodeBelow(node high, int low);


    inline void addDFSPath(SListPure<edge>& list, node bottom, node top);


    inline void addDFSPathReverse(SListPure<edge>& list, node bottom, node top);


    inline void truncateEdgelist(SListPure<edge>& list1, const SListPure<edge>& list2);


    void extractMinorA(SList<KuratowskiWrapper>& output, const KuratowskiStructure& k,

#if 0

            const WInfo& info,

#endif

            const SListPure<edge>& pathX, const node endnodeX, const SListPure<edge>& pathY,

            const node endnodeY, const SListPure<edge>& pathW);

    void extractMinorB(SList<KuratowskiWrapper>& output,

            //NodeArray<int>& nodeflags,

            //const int nodemarker,

            const KuratowskiStructure& k, const WInfo& info, const SListPure<edge>& pathX,

            const node endnodeX, const SListPure<edge>& pathY, const node endnodeY,

            const SListPure<edge>& pathW);

    void extractMinorBBundles(SList<KuratowskiWrapper>& output, NodeArray<int>& nodeflags,

            const int nodemarker, const KuratowskiStructure& k, EdgeArray<int>& flags,

            const WInfo& info, const SListPure<edge>& pathX, const node endnodeX,

            const SListPure<edge>& pathY, const node endnodeY, const SListPure<edge>& pathW);

    void extractMinorC(SList<KuratowskiWrapper>& output, const KuratowskiStructure& k,

            const WInfo& info, const SListPure<edge>& pathX, const node endnodeX,

            const SListPure<edge>& pathY, const node endnodeY, const SListPure<edge>& pathW);

    void extractMinorD(SList<KuratowskiWrapper>& output, const KuratowskiStructure& k,

            const WInfo& info, const SListPure<edge>& pathX, const node endnodeX,

            const SListPure<edge>& pathY, const node endnodeY, const SListPure<edge>& pathW);

    void extractMinorE(SList<KuratowskiWrapper>& output, bool firstXPath, bool firstPath,

            bool firstWPath, bool firstWOnHighestXY, const KuratowskiStructure& k,

            const WInfo& info, const SListPure<edge>& pathX, const node endnodeX,

            const SListPure<edge>& pathY, const node endnodeY, const SListPure<edge>& pathW);

    void extractMinorEBundles(SList<KuratowskiWrapper>& output, bool firstXPath, bool firstPath,

            bool firstWPath, bool firstWOnHighestXY, NodeArray<int>& nodeflags,

            const int nodemarker, const KuratowskiStructure& k, EdgeArray<int>& flags,

            const WInfo& info, const SListPure<edge>& pathX, const node endnodeX,

            const SListPure<edge>& pathY, const node endnodeY, const SListPure<edge>& pathW);


    inline bool isMinorE1(int before, bool firstXPath, bool firstYPath) const {

        return (before == -1 && firstXPath) || (before == 1 && firstYPath);

    }


    void extractMinorE1(SList<KuratowskiWrapper>& output, int before,

#if 0

            const node z,

#endif

            const node px, const node py, const KuratowskiStructure& k, const WInfo& info,

            const SListPure<edge>& pathX, const node endnodeX, const SListPure<edge>& pathY,

            const node endnodeY, const SListPure<edge>& pathW, const SListPure<edge>& pathZ,

            const node endnodeZ);


    inline bool checkMinorE2(bool firstWPath, bool firstWOnHighestXY) const {

        return !m_avoidE2Minors && firstWPath && firstWOnHighestXY;

    }


    inline bool isMinorE2(const node endnodeX, const node endnodeY, const node endnodeZ) const {

        return m_dfi[endnodeZ] > m_dfi[endnodeX] && m_dfi[endnodeZ] > m_dfi[endnodeY];

    }


    void extractMinorE2(SList<KuratowskiWrapper>& output,

#if 0

            int before,

            const node z,

            const node px,

            const node py,

#endif

            const KuratowskiStructure& k, const WInfo& info, const SListPure<edge>& pathX,

            const node endnodeX, const SListPure<edge>& pathY, const node endnodeY,

#if 0

            const SListPure<edge>& pathW,

#endif

            const SListPure<edge>& pathZ

#if 0

            , const node endnodeZ

#endif

    );


    inline bool isMinorE3(const node endnodeX, const node endnodeY, const node endnodeZ) const {

        return endnodeX != endnodeY

                && (m_dfi[endnodeX] > m_dfi[endnodeZ] || m_dfi[endnodeY] > m_dfi[endnodeZ]);

    }


    void extractMinorE3(SList<KuratowskiWrapper>& output, int before, const node z, const node px,

            const node py, const KuratowskiStructure& k, const WInfo& info,

            const SListPure<edge>& pathX, const node endnodeX, const SListPure<edge>& pathY,

            const node endnodeY, const SListPure<edge>& pathW, const SListPure<edge>& pathZ,

            const node endnodeZ);


    inline bool isMinorE4(const node px, const node py, const KuratowskiStructure& k,

            const WInfo& info) const {

        return (px != k.stopX && !info.pxAboveStopX) || (py != k.stopY && !info.pyAboveStopY);

    }


    void extractMinorE4(SList<KuratowskiWrapper>& output, int before, const node z, const node px,

            const node py, const KuratowskiStructure& k, const WInfo& info,

            const SListPure<edge>& pathX, const node endnodeX, const SListPure<edge>& pathY,

            const node endnodeY, const SListPure<edge>& pathW, const SListPure<edge>& pathZ,

            const node endnodeZ);


    inline bool isMinorE5(const node px, const node py, const KuratowskiStructure& k,

            const node endnodeX, const node endnodeY, const node endnodeZ) const {

        return px == k.stopX && py == k.stopY && k.V == k.RReal

                && ((endnodeX == endnodeY && m_dfi[endnodeZ] <= m_dfi[endnodeX])

                        || (endnodeX == endnodeZ && m_dfi[endnodeY] <= m_dfi[endnodeX])

                        || (endnodeY == endnodeZ && m_dfi[endnodeX] <= m_dfi[endnodeY]));

    }


    void extractMinorE5(SList<KuratowskiWrapper>& output,

#if 0

            int before,

            const node z,

            const node px,

            const node py,

#endif

            const KuratowskiStructure& k, const WInfo& info, const SListPure<edge>& pathX,

            const node endnodeX, const SListPure<edge>& pathY, const node endnodeY,

            const SListPure<edge>& pathW, const SListPure<edge>& pathZ, const node endnodeZ);

};


}

Array.h
Declaration and implementation of Array class and Array algorithms.

FindKuratowskis.h
Declaration of the class FindKuratowskis.

Graph.h
Includes declaration of graph class.

SList.h
Declaration of singly linked lists and iterators.

basic.h
Basic declarations, included by all source files.

ogdf::AdjElement
Class for adjacency list elements.
Definition Graph_d.h:143

ogdf::Array
The parameterized class Array implements dynamic arrays of type E.
Definition Array.h:219

ogdf::BoyerMyrvoldPlanar
This class implements the extended BoyerMyrvold planarity embedding algorithm.
Definition BoyerMyrvoldPlanar.h:66

ogdf::ExtractKuratowskis
Extracts multiple Kuratowski Subdivisions.
Definition ExtractKuratowskis.h:95

ogdf::ExtractKuratowskis::extractMinorA
void extractMinorA(SList< KuratowskiWrapper > &output, const KuratowskiStructure &k, const SListPure< edge > &pathX, const node endnodeX, const SListPure< edge > &pathY, const node endnodeY, const SListPure< edge > &pathW)
Extracts minortype A and adds it to list output.

ogdf::ExtractKuratowskis::extractMinorEBundles
void extractMinorEBundles(SList< KuratowskiWrapper > &output, bool firstXPath, bool firstPath, bool firstWPath, bool firstWOnHighestXY, NodeArray< int > &nodeflags, const int nodemarker, const KuratowskiStructure &k, EdgeArray< int > &flags, const WInfo &info, const SListPure< edge > &pathX, const node endnodeX, const SListPure< edge > &pathY, const node endnodeY, const SListPure< edge > &pathW)
Extracts minortype E and adds it to list output (bundles)

ogdf::ExtractKuratowskis::m_embeddingGrade
int m_embeddingGrade
Some parameters, see BoyerMyrvold for further instructions.
Definition ExtractKuratowskis.h:166

ogdf::ExtractKuratowskis::extractMinorE1
void extractMinorE1(SList< KuratowskiWrapper > &output, int before, const node px, const node py, const KuratowskiStructure &k, const WInfo &info, const SListPure< edge > &pathX, const node endnodeX, const SListPure< edge > &pathY, const node endnodeY, const SListPure< edge > &pathW, const SListPure< edge > &pathZ, const node endnodeZ)
Extracts minorsubtype E1 and adds it to list output.

ogdf::ExtractKuratowskis::addDFSPathReverse
void addDFSPathReverse(SListPure< edge > &list, node bottom, node top)
Adds DFS-path from node top to node bottom to list.

ogdf::ExtractKuratowskis::isMinorE3
bool isMinorE3(const node endnodeX, const node endnodeY, const node endnodeZ) const
Checks for minortype E3.
Definition ExtractKuratowskis.h:293

ogdf::ExtractKuratowskis::m_nodeFromDFI
const Array< node > & m_nodeFromDFI
Returns appropriate node from given DFI.
Definition ExtractKuratowskis.h:181

ogdf::ExtractKuratowskis::extract
void extract(const SListPure< KuratowskiStructure > &allKuratowskis, SList< KuratowskiWrapper > &output)
Extracts all Kuratowski Subdivisions and adds them to output (without bundles)

ogdf::ExtractKuratowskis::BMP
BoyerMyrvoldPlanar & BMP
Link to class BoyerMyrvoldPlanar.
Definition ExtractKuratowskis.h:160

ogdf::ExtractKuratowskis::extractMinorBBundles
void extractMinorBBundles(SList< KuratowskiWrapper > &output, NodeArray< int > &nodeflags, const int nodemarker, const KuratowskiStructure &k, EdgeArray< int > &flags, const WInfo &info, const SListPure< edge > &pathX, const node endnodeX, const SListPure< edge > &pathY, const node endnodeY, const SListPure< edge > &pathW)
Extracts minortype B and adds it to list output (with bundles)

ogdf::ExtractKuratowskis::isMinorE4
bool isMinorE4(const node px, const node py, const KuratowskiStructure &k, const WInfo &info) const
Checks for minortype E4.
Definition ExtractKuratowskis.h:306

ogdf::ExtractKuratowskis::operator=
ExtractKuratowskis & operator=(const ExtractKuratowskis &)
Assignment operator is undefined!

ogdf::ExtractKuratowskis::KuratowskiType
KuratowskiType
Enumeration over Kuratowski Type none, K33, K5.
Definition ExtractKuratowskis.h:112

ogdf::ExtractKuratowskis::KuratowskiType::K5
@ K5
a K5 subdivision exists

ogdf::ExtractKuratowskis::KuratowskiType::none
@ none
no kuratowski subdivision exists

ogdf::ExtractKuratowskis::KuratowskiType::K33
@ K33
a K3,3 subdivision exists

ogdf::ExtractKuratowskis::isANewKuratowski
static bool isANewKuratowski(const Graph &g, const SListPure< edge > &kuratowski, const SList< KuratowskiWrapper > &output)
Returns true, iff the Kuratowski is not already contained in output.

ogdf::ExtractKuratowskis::extractMinorB
void extractMinorB(SList< KuratowskiWrapper > &output, const KuratowskiStructure &k, const WInfo &info, const SListPure< edge > &pathX, const node endnodeX, const SListPure< edge > &pathY, const node endnodeY, const SListPure< edge > &pathW)
Extracts minortype B and adds it to list output (no bundles)

ogdf::ExtractKuratowskis::adjToLowestNodeBelow
adjEntry adjToLowestNodeBelow(node high, int low)
Returns adjEntry of the edge between node high and a special node.

ogdf::ExtractKuratowskis::extractMinorE4
void extractMinorE4(SList< KuratowskiWrapper > &output, int before, const node z, const node px, const node py, const KuratowskiStructure &k, const WInfo &info, const SListPure< edge > &pathX, const node endnodeX, const SListPure< edge > &pathY, const node endnodeY, const SListPure< edge > &pathW, const SListPure< edge > &pathZ, const node endnodeZ)
Extracts minorsubtype E4 and adds it to list output.

ogdf::ExtractKuratowskis::isMinorE5
bool isMinorE5(const node px, const node py, const KuratowskiStructure &k, const node endnodeX, const node endnodeY, const node endnodeZ) const
Checks for minortype E5 (K5)
Definition ExtractKuratowskis.h:319

ogdf::ExtractKuratowskis::extractMinorD
void extractMinorD(SList< KuratowskiWrapper > &output, const KuratowskiStructure &k, const WInfo &info, const SListPure< edge > &pathX, const node endnodeX, const SListPure< edge > &pathY, const node endnodeY, const SListPure< edge > &pathW)
Extracts minortype D and adds it to list output.

ogdf::ExtractKuratowskis::whichKuratowski
static KuratowskiType whichKuratowski(const Graph &m_g, const NodeArray< int > &dfi, const SListPure< edge > &list)
Checks, if list forms a valid Kuratowski Subdivision and returns the type.

ogdf::ExtractKuratowskis::m_nodeMarker
int m_nodeMarker
Value used as marker for visited nodes etc.
Definition ExtractKuratowskis.h:173

ogdf::ExtractKuratowskis::extractBundles
void extractBundles(const SListPure< KuratowskiStructure > &allKuratowskis, SList< KuratowskiWrapper > &output)
Extracts all Kuratowski Subdivisions and adds them to output (with bundles)

ogdf::ExtractKuratowskis::isMinorE1
bool isMinorE1(int before, bool firstXPath, bool firstYPath) const
Checks for minortype E1.
Definition ExtractKuratowskis.h:251

ogdf::ExtractKuratowskis::ExtractKuratowskis
ExtractKuratowskis(BoyerMyrvoldPlanar &bm)
Constructor.

ogdf::ExtractKuratowskis::checkMinorE2
bool checkMinorE2(bool firstWPath, bool firstWOnHighestXY) const
Checks for minortype E2 preconditions.
Definition ExtractKuratowskis.h:265

ogdf::ExtractKuratowskis::m_adjParent
const NodeArray< adjEntry > & m_adjParent
The adjEntry which goes from DFS-parent to current vertex.
Definition ExtractKuratowskis.h:184

ogdf::ExtractKuratowskis::whichKuratowskiArray
static KuratowskiType whichKuratowskiArray(const Graph &g, EdgeArray< int > &edgenumber)
Checks, if edges in Array edgenumber form a valid Kuratowski Subdivision and returns the type.

ogdf::ExtractKuratowskis::extractMinorE2
void extractMinorE2(SList< KuratowskiWrapper > &output, const KuratowskiStructure &k, const WInfo &info, const SListPure< edge > &pathX, const node endnodeX, const SListPure< edge > &pathY, const node endnodeY, const SListPure< edge > &pathZ)
Extracts minorsubtype E2 and adds it to list output.

ogdf::ExtractKuratowskis::m_g
const Graph & m_g
Input graph.
Definition ExtractKuratowskis.h:163

ogdf::ExtractKuratowskis::addDFSPath
void addDFSPath(SListPure< edge > &list, node bottom, node top)
Adds DFS-path from node bottom to node top to list.

ogdf::ExtractKuratowskis::m_wasHere
NodeArray< int > m_wasHere
Array maintaining visited bits on each node.
Definition ExtractKuratowskis.h:175

ogdf::ExtractKuratowskis::extractMinorE5
void extractMinorE5(SList< KuratowskiWrapper > &output, const KuratowskiStructure &k, const WInfo &info, const SListPure< edge > &pathX, const node endnodeX, const SListPure< edge > &pathY, const node endnodeY, const SListPure< edge > &pathW, const SListPure< edge > &pathZ, const node endnodeZ)
Extracts minorsubtype E5 and adds it to list output.

ogdf::ExtractKuratowskis::m_dfi
const NodeArray< int > & m_dfi
The one and only DFI-NodeArray.
Definition ExtractKuratowskis.h:178

ogdf::ExtractKuratowskis::isMinorE2
bool isMinorE2(const node endnodeX, const node endnodeY, const node endnodeZ) const
Checks for minortype E2.
Definition ExtractKuratowskis.h:270

ogdf::ExtractKuratowskis::~ExtractKuratowskis
~ExtractKuratowskis()
Destructor.
Definition ExtractKuratowskis.h:101

ogdf::ExtractKuratowskis::isANewKuratowski
static bool isANewKuratowski(const EdgeArray< int > &test, const SList< KuratowskiWrapper > &output)
Returns true, iff the Kuratowski is not already contained in output.

ogdf::ExtractKuratowskis::truncateEdgelist
void truncateEdgelist(SListPure< edge > &list1, const SListPure< edge > &list2)
Separates list1 from edges already contained in list2.

ogdf::ExtractKuratowskis::extractMinorE3
void extractMinorE3(SList< KuratowskiWrapper > &output, int before, const node z, const node px, const node py, const KuratowskiStructure &k, const WInfo &info, const SListPure< edge > &pathX, const node endnodeX, const SListPure< edge > &pathY, const node endnodeY, const SListPure< edge > &pathW, const SListPure< edge > &pathZ, const node endnodeZ)
Extracts minorsubtype E3 and adds it to list output.

ogdf::ExtractKuratowskis::m_avoidE2Minors
const bool m_avoidE2Minors
Some parameters, see BoyerMyrvold for further instructions.
Definition ExtractKuratowskis.h:168

ogdf::ExtractKuratowskis::extractMinorE
void extractMinorE(SList< KuratowskiWrapper > &output, bool firstXPath, bool firstPath, bool firstWPath, bool firstWOnHighestXY, const KuratowskiStructure &k, const WInfo &info, const SListPure< edge > &pathX, const node endnodeX, const SListPure< edge > &pathY, const node endnodeY, const SListPure< edge > &pathW)
Extracts minortype E and adds it to list output (no bundles)

ogdf::ExtractKuratowskis::addExternalFacePath
void addExternalFacePath(SListPure< edge > &list, const SListPure< adjEntry > &externPath)
Adds external face edges to list.
Definition ExtractKuratowskis.h:187

ogdf::ExtractKuratowskis::extractMinorC
void extractMinorC(SList< KuratowskiWrapper > &output, const KuratowskiStructure &k, const WInfo &info, const SListPure< edge > &pathX, const node endnodeX, const SListPure< edge > &pathY, const node endnodeY, const SListPure< edge > &pathW)
Extracts minortype C and adds it to list output.

ogdf::Graph
Data type for general directed graphs (adjacency list representation).
Definition Graph_d.h:866

ogdf::KuratowskiStructure
A Kuratowski Structure is a special graph structure containing severals subdivisions.
Definition FindKuratowskis.h:96

ogdf::KuratowskiStructure::stopX
node stopX
First stopping node.
Definition FindKuratowskis.h:131

ogdf::KuratowskiStructure::stopY
node stopY
Second stopping node.
Definition FindKuratowskis.h:133

ogdf::KuratowskiStructure::RReal
node RReal
Real node of virtual node R.
Definition FindKuratowskis.h:129

ogdf::KuratowskiStructure::V
node V
The current node to embed.
Definition FindKuratowskis.h:120

ogdf::KuratowskiWrapper
Wrapper-class for Kuratowski Subdivisions containing the minortype and edgelist.
Definition ExtractKuratowskis.h:47

ogdf::KuratowskiWrapper::V
node V
The node which was embedded while the Kuratowski Subdivision was found.
Definition ExtractKuratowskis.h:81

ogdf::KuratowskiWrapper::SubdivisionType
SubdivisionType
Possible minortypes of a Kuratowski Subdivision.
Definition ExtractKuratowskis.h:59

ogdf::KuratowskiWrapper::subdivisionType
SubdivisionType subdivisionType
Minortype of the Kuratowski Subdivision.
Definition ExtractKuratowskis.h:78

ogdf::KuratowskiWrapper::isK33
bool isK33() const
Returns true, iff subdivision is a K3,3-minor.
Definition ExtractKuratowskis.h:53

ogdf::KuratowskiWrapper::isK5
bool isK5() const
Returns true, iff subdivision is a K5-minor.
Definition ExtractKuratowskis.h:56

ogdf::KuratowskiWrapper::KuratowskiWrapper
KuratowskiWrapper()
Constructor.
Definition ExtractKuratowskis.h:50

ogdf::KuratowskiWrapper::edgeList
SListPure< edge > edgeList
Contains the edges of the Kuratowski Subdivision.
Definition ExtractKuratowskis.h:84

ogdf::NodeElement
Class for the representation of nodes.
Definition Graph_d.h:241

ogdf::SList
Singly linked lists (maintaining the length of the list).
Definition SList.h:845

ogdf::SListIteratorBase
Encapsulates a pointer to an ogdf::SList element.
Definition SList.h:104

ogdf::SListIteratorBase::valid
bool valid() const
Returns true iff the iterator points to an element.
Definition SList.h:134

ogdf::SListPure
Singly linked lists.
Definition SList.h:191

ogdf::SListPure::begin
iterator begin()
Returns an iterator to the first element of the list.
Definition SList.h:344

ogdf::SListPure::pushBack
iterator pushBack(const E &x)
Adds element x at the end of the list.
Definition SList.h:481

ogdf::internal::EdgeArrayBase2
RegisteredArray for edges of a graph, specialized for EdgeArray<edge>.
Definition Graph_d.h:717

ogdf::internal::GraphRegisteredArray
RegisteredArray for nodes, edges and adjEntries of a graph.
Definition Graph_d.h:659

OGDF_EXPORT
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF dynamic library (shared object / DLL),...
Definition config.h:117

ogdf
The namespace for all OGDF objects.
Definition multilevelmixer.cpp:39

ogdf::operator<<
std::ostream & operator<<(std::ostream &os, const ogdf::Array< E, INDEX > &a)
Prints array a to output stream os.
Definition Array.h:983

ogdf::whaType::A
@ A

ogdf::Direction::before
@ before

ogdf::WInfo
Saves information about a pertinent node w between two stopping vertices.
Definition FindKuratowskis.h:62

ogdf::WInfo::pyAboveStopY
bool pyAboveStopY
Definition FindKuratowskis.h:79

ogdf::WInfo::pxAboveStopX
bool pxAboveStopX
Definition FindKuratowskis.h:78