Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

Loading...
Searching...
No Matches
CconnectClusterPlanar.h
Go to the documentation of this file.
1
33#pragma once
34
38
39namespace ogdf {
40
42
46public:
47 //aus CCCPE oder CCCP wieder entfernen
48 enum class ErrorCode {
49 none = 0,
50 nonConnected = 1,
51 nonCConnected = 2,
52 nonPlanar = 3,
53 nonCPlanar = 4
54 };
55
56 ErrorCode errCode() { return m_errorCode; }
57
60
63
65 virtual bool call(const ClusterGraph& C);
66
67private:
69
71 bool planarityTest(ClusterGraph& C, const cluster act, Graph& G);
72
75
78
82
84
88
89
90 //private Members for handling parallel edges
95
97};
98
99}
Declaration and implementation of ClusterArray class.
Declaration and implementation of EdgeArray class.
Declaration of class PlanarPQTree.
C-planarity test by Cohen, Feng and Eades.
bool preProcess(ClusterGraph &C, Graph &G)
Preprocessing that initializes data structures, used in call.
void constructWheelGraph(ClusterGraph &C, Graph &G, cluster &parent, PlanarPQTree *T, EdgeArray< node > &outgoingTable)
Constructs the replacement wheel graphs.
EdgeArray< ListPure< edge > > m_parallelEdges
CconnectClusterPlanar()
Constructor.
virtual bool call(const ClusterGraph &C)
Tests if a cluster graph is c-planar.
virtual ~CconnectClusterPlanar()
Destructor.
bool planarityTest(ClusterGraph &C, const cluster act, Graph &G)
Recursive planarity test for clustered graph induced by act.
bool preparation(Graph &G, const cluster C, node superSink)
Prepares the planarity test for one cluster.
ClusterArray< PlanarPQTree * > m_clusterPQTree
void prepareParallelEdges(Graph &G)
bool doTest(Graph &G, NodeArray< int > &numbering, const cluster cl, node superSink, EdgeArray< edge > &edgeTable)
Performs a planarity test on a biconnected component.
Dynamic arrays indexed with clusters.
Representation of clusters in a clustered graph.
Representation of clustered graphs.
Dynamic arrays indexed with edges.
Definition EdgeArray.h:125
Data type for general directed graphs (adjacency list representation).
Definition Graph_d.h:521
Dynamic arrays indexed with nodes.
Definition NodeArray.h:125
Class for the representation of nodes.
Definition Graph_d.h:177
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
Definition config.h:101
static MultilevelBuilder * getDoubleFactoredZeroAdjustedMerger()
The namespace for all OGDF objects.