Loading [MathJax]/extensions/tex2jax.js

Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Modules Pages
Loading...
Searching...
No Matches
PertinentGraph.h
Go to the documentation of this file.
1
32#pragma once
33
34#include <ogdf/basic/Graph.h>
35
36namespace ogdf {
37
38class OGDF_EXPORT SPQRTree;
39
41
60 friend class OGDF_EXPORT SPQRTree;
61
62public:
63 // constructor
64 // Remark: Pertinent graphs are created by the pertinentGraph()
65 // function of SPQRTree.
66
68
72 PertinentGraph() : m_vT(nullptr) { }
73
75 void init(node vT) {
76 m_P = Graph();
77 m_vT = vT;
78 m_vEdge = m_skRefEdge = nullptr;
79 m_origV.init(m_P, nullptr);
80 m_origE.init(m_P, nullptr);
81 }
82
84 node treeNode() const { return m_vT; }
85
87 const Graph& getGraph() const { return m_P; }
88
90 Graph& getGraph() { return m_P; }
91
93
96 edge referenceEdge() const { return m_vEdge; }
97
99
103 edge skeletonReferenceEdge() const { return m_skRefEdge; }
104
106
109 node original(node v) const { return m_origV[v]; }
110
112
116 edge original(edge e) const { return m_origE[e]; }
117
118protected:
123
126};
127
128}
Includes declaration of graph class.
Dynamic arrays indexed with edges.
Definition EdgeArray.h:125
Class for the representation of edges.
Definition Graph_d.h:300
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
Pertinent graphs of nodes in an SPQR-tree.
const Graph & getGraph() const
Returns a reference to G(vT).
node m_vT
corresponding tree node
edge m_vEdge
reference edge (in m_P)
edge m_skRefEdge
reference edge (in skeleton(m_vT))
edge referenceEdge() const
Returns the edge in G(vT) corresponding to the reference edge in skeleton of vT.
Graph m_P
actual graph
EdgeArray< edge > m_origE
corresp.
NodeArray< node > m_origV
corresp.
node treeNode() const
Returns the tree node vT in T whose pertinent graph is this one.
PertinentGraph()
Creates an empty instance of type PertinentGraph.
void init(node vT)
Initialization of a pertinent graph of tree node vT.
Graph & getGraph()
Returns a reference to G(vT).
edge original(edge e) const
Returns the edge in G that corresponds to e.
node original(node v) const
Returns the vertex in G that corresponds to v.
edge skeletonReferenceEdge() const
Returns the reference edge in skeleton of vT.
Linear-time implementation of static SPQR-trees.
Definition SPQRTree.h:70
#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.