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
BoyerMyrvoldInit.h
Go to the documentation of this file.
1
33#pragma once
34
35#include <ogdf/basic/List.h>
37
38#include <limits>
39#include <random>
40
41namespace ogdf {
128}
Declaration of the class BoyerMyrvoldPlanar.
Declaration of doubly linked lists and iterators.
Class for adjacency list elements.
Definition Graph_d.h:79
The parameterized class Array implements dynamic arrays of type E.
Definition Array.h:214
This class implements the extended BoyerMyrvold planarity embedding algorithm.
Dynamic arrays indexed with edges.
Definition EdgeArray.h:125
Data type for general directed graphs (adjacency list representation).
Definition Graph_d.h:521
Dynamic arrays indexed with nodes.
Definition NodeArray.h:125
This class is used in the Boyer-Myrvold planarity test for preprocessing purposes.
BoyerMyrvoldInit & operator=(const BoyerMyrvoldInit &)
Assignment operator is undefined!
const int & m_embeddingGrade
Some parameters... see BoyerMyrvold.h for further instructions.
NodeArray< node > & m_realVertex
Link to non-virtual vertex of a virtual Vertex.
NodeArray< adjEntry > & m_adjParent
The adjEntry which goes from DFS-parent to current vertex.
NodeArray< int > & m_leastAncestor
The DFI of the least ancestor node over all backedges.
Array< node > & m_nodeFromDFI
Returns appropriate node from given DFI.
BoyerMyrvoldInit(BoyerMyrvoldPlanar *pBM)
Constructor, the parameter BoyerMyrvoldPlanar is needed.
void computeDFSChildLists()
Computes the list of separated DFS children for all nodes.
EdgeArray< BoyerMyrvoldEdgeType > & m_edgeType
Contains the type of each edge.
void computeLowPoints()
Computes lowpoint, highestSubtreeDFI and links virtual to nonvirtual vertices.
void computeDFS()
Creates the DFSTree.
NodeArray< ListPure< node > > & m_separatedDFSChildList
A list to all separated DFS-children of node.
void createVirtualVertex(const adjEntry father)
Creates and links a virtual vertex of the node belonging to father.
NodeArray< ListIterator< node > > & m_pNodeInParent
Pointer to node contained in the DFSChildList of his parent, if exists.
NodeArray< int > & m_lowPoint
The lowpoint of each node.
NodeArray< int > & m_highestSubtreeDFI
The highest DFI in a subtree with node as root.
NodeArray< int > & m_dfi
The one and only DFI-Array.
static MultilevelBuilder * getDoubleFactoredZeroAdjustedMerger()
The namespace for all OGDF objects.