Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

Loading...
Searching...
No Matches
PlanarAugmentationFix.h
Go to the documentation of this file.
1
32#pragma once
33
38
39namespace ogdf {
40
47public:
50
53
54protected:
61 virtual void doCall(Graph& g, List<edge>& list) override;
62
63private:
65 CombinatorialEmbedding* m_pEmbedding = nullptr;
66
68 CombinatorialEmbedding* m_pActEmbedding = nullptr;
69
71 Graph* m_pGraph = nullptr;
72
74 List<edge>* m_pResult = nullptr;
75
77 DynamicBCTree* m_pBCTree = nullptr;
78
81
84
87
90
93
96
99
102
105
108
111
114
117
120
123
126
129
132
135
138
140 void deleteLabel(pa_label& label);
141
143 void removeLabel(pa_label& label);
144};
145
146}
Declaration of interface for graph augmentation algorithms.
Declaration of class DynamicBCTree.
Declaration of graph copy classes.
Declares auxiliary structure of planar augmentation algorithms.
Class for adjacency list elements.
Definition Graph_d.h:79
The base class for graph augmentation algorithms.
Combinatorial embeddings of planar graphs with modification functionality.
Dynamic BC-trees.
Dynamic arrays indexed with edges.
Definition EdgeArray.h:125
Copies of graphs supporting edge splitting.
Definition GraphCopy.h:254
Data type for general directed graphs (adjacency list representation).
Definition Graph_d.h:521
Doubly linked lists (maintaining the length of the list).
Definition List.h:1435
Encapsulates a pointer to a list element.
Definition List.h:103
Dynamic arrays indexed with nodes.
Definition NodeArray.h:125
Class for the representation of nodes.
Definition Graph_d.h:177
auxiliary class for the planar augmentation algorithm
Definition PALabel.h:45
The algorithm for biconnectivity augmentation with fixed combinatorial embedding.
virtual void doCall(Graph &g, List< edge > &list) override
The implementation of the algorithm call.
void deleteLabel(pa_label &label)
Deletes the given label.
node m_actBCRoot
The actual root of the bc-tree.
void addPendant(node pendant, pa_label &label)
Adds pendant to label.
void reduceChain(node pendant)
Adds pendant to a label or creates one.
void connectSingleLabel()
Connects the remaining label.
PlanarAugmentationFix()
Creates an instance of planar augmentation with fixed embedding.
void connectPendants(node pendant1, node pendant2, adjEntry adjV1, adjEntry adjV2)
Connects the two pendants.
void findMatchingRev(node &pendant1, node &pendant2, adjEntry &v1, adjEntry &v2)
Called by findMatching, if a dominating tree was detected.
pa_label newLabel(node cutvertex, node parent, node pendant, PALabel::StopCause whyStop)
Creates a new label.
EdgeArray< edge > m_eCopy
Edge-array required for construction of the graph copy.
PALabel::StopCause followPath(node v, node &last)
Traverses upwards in the bc-tree, starting at the pendant node v.
NodeArray< ListIterator< pa_label > > m_isLabel
Array that contains iterators to the list of labels if a node is a parent of a label.
void modifyBCRoot(node oldRoot, node newRoot)
Modifies the root of the bc-tree.
NodeArray< pa_label > m_belongsTo
Array that contains the label a node belongs to.
bool findMatching(node &pendant1, node &pendant2, adjEntry &v1, adjEntry &v2)
Finds the next matching pendants.
void removeLabel(pa_label &label)
Removes the given label from the list of labels.
void changeBCRoot(node oldRoot, node newRoot)
Exchanges oldRoot by newRoot and updates data structurs in the bc-tree.
NodeArray< ListIterator< node > > m_belongsToIt
Array that contains the iterator of the label a node belongs to.
void augment(adjEntry adjOuterFace)
The main function for planar augmentation.
ListIterator< pa_label > insertLabel(pa_label label)
Inserts label into the list of labels maintaining decreasing order.
void deletePendant(node pendant)
Deletes the given pendant.
List< pa_label > m_labels
The list of all labels.
GraphCopy m_graphCopy
The actual partial graph.
#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.