Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

Loading...
Searching...
No Matches
HananiTutteCPlanarity.h
Go to the documentation of this file.
1
33#pragma once
34
36
37namespace ogdf {
38
39
41
45 class CLinearSystem;
46 class CGraph;
47
48public:
67
68 enum class Type : uint16_t { tVertex, tEdge };
79
80 Verification isCPlanar(const ClusterGraph& C, bool doPreproc = true, bool forceSolver = false,
82
83 Status status() const { return m_status; }
84
86
87 int numNodesPreproc() const { return m_numNodesPreproc; }
88
89 int numEdgesPreproc() const { return m_numEdgesPreproc; }
90
92
93 int numMatrixRows() const { return m_nRows; }
94
95 int numMatrixCols() const { return m_nCols; }
96
97 int64_t timePrepare() const { return m_tPrepare; }
98
100
101 int64_t timesolve() const { return m_tSolve; }
102
103private:
104 int m_nRows = 0;
105 int m_nCols = 0;
109
114};
115
116
117}
Derived class of GraphObserver providing additional functionality to handle clustered graphs.
Representation of clustered graphs.
Data type for general directed graphs (adjacency list representation).
Definition Graph_d.h:521
C-planarity testing via Hanani-Tutte approach.
Verification isCPlanar(const ClusterGraph &C, bool doPreproc=true, bool forceSolver=false, Solver solver=Solver::HananiTutte)
void preprocessing(ClusterGraph &C, Graph &G)
static MultilevelBuilder * getDoubleFactoredZeroAdjustedMerger()
The namespace for all OGDF objects.