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)
EdgeArray< bool > m_isParallel
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.
Data type for general directed graphs (adjacency list representation).
Dynamic arrays indexed with nodes.
Class for the representation of nodes.
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
static MultilevelBuilder * getDoubleFactoredZeroAdjustedMerger()
The namespace for all OGDF objects.