|
Open Graph Drawing Framework |
v. 2023.09 (Elderberry)
|
|
|
Go to the documentation of this file.
42 class BoyerMyrvoldPlanar;
45 namespace boyer_myrvold {
The namespace for all OGDF objects.
Includes declaration of graph class.
const int & m_embeddingGrade
Some parameters... see BoyerMyrvold.h for further instructions.
NodeArray< int > & m_leastAncestor
The DFI of the least ancestor node over all backedges.
NodeArray< node > & m_realVertex
Link to non-virtual vertex of a virtual Vertex.
NodeArray< int > & m_dfi
The one and only DFI-Array.
const double & m_randomness
void computeDFSChildLists()
Computes the list of separated DFS children for all nodes.
BoyerMyrvoldInit(BoyerMyrvoldPlanar *pBM)
Constructor, the parameter BoyerMyrvoldPlanar is needed.
void computeDFS()
Creates the DFSTree.
BoyerMyrvoldInit & operator=(const BoyerMyrvoldInit &)
Assignment operator is undefined!
NodeArray< ListPure< node > > & m_separatedDFSChildList
A list to all separated DFS-children of node.
Class for adjacency list elements.
NodeArray< ListIterator< node > > & m_pNodeInParent
Pointer to node contained in the DFSChildList of his parent, if exists.
Array< node > & m_nodeFromDFI
Returns appropriate node from given DFI.
RegisteredArray for nodes, edges and adjEntries of a graph.
Data type for general directed graphs (adjacency list representation).
const EdgeArray< int > * m_edgeCosts
NodeArray< int > & m_lowPoint
The lowpoint of each node.
void createVirtualVertex(const adjEntry father)
Creates and links a virtual vertex of the node belonging to father.
Declaration and implementation of Array class and Array algorithms.
This class implements the extended BoyerMyrvold planarity embedding algorithm.
EdgeArray< BoyerMyrvoldEdgeType > & m_edgeType
Contains the type of each edge.
Declaration of doubly linked lists and iterators.
BoyerMyrvoldEdgeType
Type of edge.
Graph & m_g
The input graph.
This class is used in the Boyer-Myrvold planarity test for preprocessing purposes.
NodeArray< int > & m_highestSubtreeDFI
The highest DFI in a subtree with node as root.
~BoyerMyrvoldInit()
Destructor.
void computeLowPoints()
Computes lowpoint, highestSubtreeDFI and links virtual to nonvirtual vertices.
RegisteredArray for edges of a graph, specialized for EdgeArray<edge>.
NodeArray< adjEntry > & m_adjParent
The adjEntry which goes from DFS-parent to current vertex.