Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

Loading...
Searching...
No Matches
PlanarPQTree.h
Go to the documentation of this file.
1
32#pragma once
33
34#include <ogdf/basic/Graph.h>
35#include <ogdf/basic/PQTree.h>
36
37namespace ogdf::booth_lueker {
38class IndInfo;
39template<class X>
40class PlanarLeafKey;
41} // namespace ogdf::booth_lueker
42
43namespace ogdf {
44template<class E>
45class SListPure;
46template<class T, class X, class Y>
47class PQLeafKey;
48
49namespace booth_lueker {
50
51class PlanarPQTree : public PQTree<edge, IndInfo*, bool> {
52public:
53 PlanarPQTree() : PQTree<edge, IndInfo*, bool>() { }
54
55 virtual ~PlanarPQTree() { }
56
58 virtual void emptyAllPertinentNodes() override;
59
62
66
69
71 virtual bool Reduction(SListPure<PlanarLeafKey<IndInfo*>*>& leafKeys);
72
76
77private:
80
83};
84
85}
86}
Includes declaration of graph class.
Declaration and implementation of the class PQTree.
Class for the representation of edges.
Definition Graph_d.h:364
The class template PQLeafKey is a derived class of class template PQBasicKey.
Definition PQLeafKey.h:84
virtual bool Reduction(SListPure< PQLeafKey< T, X, Y > * > &leafKeys)
Tests whether permissible permutations of the elements of U exist such that the elements of a subset ...
Definition PQTree.h:2237
virtual int Initialize(SListPure< PQLeafKey< T, X, Y > * > &leafKeys)
Initializes the PQ-tree with a set of elements.
Definition PQTree.h:1916
Singly linked lists.
Definition SList.h:191
void ReplacePartialRoot(SListPure< PlanarLeafKey< IndInfo * > * > &leafKeys)
Replaces a pertinet subtree by a set of new leaves if the root is partial.
void ReplaceFullRoot(SListPure< PlanarLeafKey< IndInfo * > * > &leafKeys)
Replaces a pertinet subtree by a set of new leaves if the root is full.
int Initialize(SListPure< PQLeafKey< edge, IndInfo *, bool > * > &leafKeys) override
virtual int Initialize(SListPure< PlanarLeafKey< IndInfo * > * > &leafKeys)
Initializes a new PQ-tree with a set of leaves.
bool Reduction(SListPure< PQLeafKey< edge, IndInfo *, bool > * > &leafKeys) override
virtual void emptyAllPertinentNodes() override
Does a clean up after a reduction.
virtual bool Reduction(SListPure< PlanarLeafKey< IndInfo * > * > &leafKeys)
Reduces a set of leaves.
void ReplaceRoot(SListPure< PlanarLeafKey< IndInfo * > * > &leafKeys)
Replaces the pertinent subtree by a set of new leaves.
The namespace for all OGDF objects.