Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

PlanarSubgraphPQTree.h
Go to the documentation of this file.
1 
36 #pragma once
37 
38 #include <ogdf/basic/Graph.h>
39 #include <ogdf/basic/PQTree.h>
40 #include <ogdf/basic/SList.h>
43 
44 namespace ogdf {
45 
47 public:
49 
51 
52  virtual ~PlanarSubgraphPQTree() { }
53 
55  virtual int Initialize(SListPure<PlanarLeafKey*>& leafKeys);
56 
59  }
60 
62  void ReplaceRoot(SListPure<PlanarLeafKey*>& leafKeys);
63 
65  virtual bool Reduction(SListPure<PlanarLeafKey*>& leafKeys,
66  SList<PQLeafKey<edge, whaInfo*, bool>*>& eliminatedKeys);
67 
70  }
71 
72 private:
74  void ReplaceFullRoot(SListPure<PlanarLeafKey*>& leafKeys);
75 
77  void ReplacePartialRoot(SListPure<PlanarLeafKey*>& leafKeys);
78 
98  void removeEliminatedLeaves(SList<PQLeafKey<edge, whaInfo*, bool>*>& eliminatedKeys);
99 };
100 
101 }
ogdf
The namespace for all OGDF objects.
Definition: AugmentationModule.h:36
Graph.h
Includes declaration of graph class.
ogdf::PlanarSubgraphPQTree::Initialize
int Initialize(SListPure< PQLeafKey< edge, whaInfo *, bool > * > &leafKeys) override
Initializes the PQ-tree with a set of elements.
Definition: PlanarSubgraphPQTree.h:57
ogdf::PQLeafKey
The class template PQLeafKey is a derived class of class template PQBasicKey.
Definition: PQLeafKey.h:87
ogdf::SList
Singly linked lists (maintaining the length of the list).
Definition: SList.h:833
PQTree.h
Declaration and implementation of the class PQTree.
ogdf::PlanarSubgraphPQTree::PlanarSubgraphPQTree
PlanarSubgraphPQTree()
Definition: PlanarSubgraphPQTree.h:50
ogdf::PlanarSubgraphPQTree::~PlanarSubgraphPQTree
virtual ~PlanarSubgraphPQTree()
Definition: PlanarSubgraphPQTree.h:52
SList.h
Declaration of singly linked lists and iterators.
ogdf::SListPure
Singly linked lists.
Definition: SList.h:39
ogdf::PQTree< T, whaInfo *, Y >::Initialize
virtual int Initialize(SListPure< PQLeafKey< T, whaInfo *, Y > * > &leafKeys)
Initializes the PQ-tree with a set of elements.
Definition: PQTree.h:1909
ogdf::PlanarSubgraphPQTree
Definition: PlanarSubgraphPQTree.h:46
ogdf::PlanarSubgraphPQTree::Reduction
bool Reduction(SListPure< PQLeafKey< edge, whaInfo *, bool > * > &leafKeys) override
Tests whether permissible permutations of the elements of U exist such that the elements of a subset ...
Definition: PlanarSubgraphPQTree.h:68
ogdf::MaxSequencePQTree
The class template MaxSequencePQTree is designed to compute a maximal consecutive sequence of pertine...
Definition: MaxSequencePQTree.h:97
OGDF_EXPORT
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
Definition: config.h:101
MaxSequencePQTree.h
Declaration and definition of the class MaxSequencePQTree.
ogdf::EdgeElement
Class for the representation of edges.
Definition: Graph_d.h:356
ogdf::PQTree< T, whaInfo *, Y >::Reduction
virtual bool Reduction(SListPure< PQLeafKey< T, whaInfo *, Y > * > &leafKeys)
Tests whether permissible permutations of the elements of U exist such that the elements of a subset ...
Definition: PQTree.h:2230
ogdf::booth_lueker::PlanarLeafKey
Definition: PlanarLeafKey.h:41
PlanarLeafKey.h
Declaration of class PlanarLeafKey.