#include <ogdf/cluster/CconnectClusterPlanar.h>
Public Types | |
| enum | ccErrorCode { none = 0, nonConnected = 1, nonCConnected = 2, nonPlanar = 3, nonCPlanar = 4 } |
Public Member Functions | |
| ccErrorCode | errCode () |
| CconnectClusterPlanar () | |
| Constructor. | |
| virtual | ~CconnectClusterPlanar () |
| Destructor. | |
| virtual bool | call (ClusterGraph &C) |
| Tests if a ClusterGraph is C-planar. | |
| bool | call (ClusterGraph &C, char(&code)[124]) |
| virtual bool | call (const ClusterGraph &C) |
| Tests if a const ClusterGraph is C-planar. | |
Private Member Functions | |
| bool | planarityTest (ClusterGraph &C, cluster &act, Graph &G) |
| Recursive planarity test for clustered graph induced by act. | |
| bool | preProcess (ClusterGraph &C, Graph &G) |
| Preprocessing that initializes data structures, used in call. | |
| bool | preparation (Graph &G, cluster &C, node superSink) |
| Prepares the planarity test for one cluster. | |
| bool | doTest (Graph &G, NodeArray< int > &numbering, cluster &cl, node superSink, EdgeArray< edge > &edgeTable) |
| Performs a planarity test on a biconnected component. | |
| void | prepareParallelEdges (Graph &G) |
| void | constructWheelGraph (ClusterGraph &C, Graph &G, cluster &parent, PlanarPQTree *T, EdgeArray< node > &outgoingTable) |
| Constructs the replacement wheel graphs. | |
Private Attributes | |
| EdgeArray< ListPure< edge > > | m_parallelEdges |
| EdgeArray< bool > | m_isParallel |
| ClusterArray< PlanarPQTree * > | m_clusterPQTree |
| int | m_parallelCount |
| char | errorCode [124] |
| ccErrorCode | m_errorCode |
Definition at line 66 of file CconnectClusterPlanar.h.
Definition at line 69 of file CconnectClusterPlanar.h.
| ogdf::CconnectClusterPlanar::CconnectClusterPlanar | ( | ) |
Constructor.
| virtual ogdf::CconnectClusterPlanar::~CconnectClusterPlanar | ( | ) | [virtual] |
Destructor.
| virtual bool ogdf::CconnectClusterPlanar::call | ( | ClusterGraph & | C | ) | [virtual] |
Tests if a ClusterGraph is C-planar.
| virtual bool ogdf::CconnectClusterPlanar::call | ( | const ClusterGraph & | C | ) | [virtual] |
Tests if a const ClusterGraph is C-planar.
| bool ogdf::CconnectClusterPlanar::call | ( | ClusterGraph & | C, | |
| char(&) | code[124] | |||
| ) |
Tests if a ClusterGraph is C-planar. Specifies reason for non planarity.
| void ogdf::CconnectClusterPlanar::constructWheelGraph | ( | ClusterGraph & | C, | |
| Graph & | G, | |||
| cluster & | parent, | |||
| PlanarPQTree * | T, | |||
| EdgeArray< node > & | outgoingTable | |||
| ) | [private] |
Constructs the replacement wheel graphs.
| bool ogdf::CconnectClusterPlanar::doTest | ( | Graph & | G, | |
| NodeArray< int > & | numbering, | |||
| cluster & | cl, | |||
| node | superSink, | |||
| EdgeArray< edge > & | edgeTable | |||
| ) | [private] |
Performs a planarity test on a biconnected component.
| ccErrorCode ogdf::CconnectClusterPlanar::errCode | ( | ) | [inline] |
Definition at line 75 of file CconnectClusterPlanar.h.
| bool ogdf::CconnectClusterPlanar::planarityTest | ( | ClusterGraph & | C, | |
| cluster & | act, | |||
| Graph & | G | |||
| ) | [private] |
Recursive planarity test for clustered graph induced by act.
Prepares the planarity test for one cluster.
| void ogdf::CconnectClusterPlanar::prepareParallelEdges | ( | Graph & | G | ) | [private] |
| bool ogdf::CconnectClusterPlanar::preProcess | ( | ClusterGraph & | C, | |
| Graph & | G | |||
| ) | [private] |
Preprocessing that initializes data structures, used in call.
char ogdf::CconnectClusterPlanar::errorCode[124] [private] |
Definition at line 126 of file CconnectClusterPlanar.h.
Definition at line 124 of file CconnectClusterPlanar.h.
Definition at line 127 of file CconnectClusterPlanar.h.
EdgeArray<bool> ogdf::CconnectClusterPlanar::m_isParallel [private] |
Definition at line 123 of file CconnectClusterPlanar.h.
int ogdf::CconnectClusterPlanar::m_parallelCount [private] |
Definition at line 125 of file CconnectClusterPlanar.h.
Definition at line 122 of file CconnectClusterPlanar.h.