Computes an embedding of a biconnected graph with maximum external face. See paper "Graph Embedding with Minimum Depth and Maximum External Face" by C. Gutwenger and P. Mutzel (2004) for details. The algorithm is combined with the algorithm for maximum external layers which defines how to embed blocks into inner faces. See diploma thesis "Algorithmen zur Bestimmung von guten Graph-Einbettungen für orthogonale Zeichnungen" (in german) of Thorsten Kerkhof (2007) for details. More...
#include <ogdf/decomposition/StaticSPQRTree.h>#include <ogdf/basic/CombinatorialEmbedding.h>#include <ogdf/planarity/PlanarModule.h>#include <ogdf/graphalg/ShortestPathWithBFM.h>Go to the source code of this file.
Classes | |
| class | ogdf::EmbedderMaxFaceBiconnectedGraphsLayers< T > |
Namespaces | |
| namespace | ogdf |
| The namespace for all OGDF objects. | |
Defines | |
| #define | OGDF_EMBEDDER_MAX_FACE_BICONNECTED_GRAPHS_Layers_H |
Computes an embedding of a biconnected graph with maximum external face. See paper "Graph Embedding with Minimum Depth and Maximum External Face" by C. Gutwenger and P. Mutzel (2004) for details. The algorithm is combined with the algorithm for maximum external layers which defines how to embed blocks into inner faces. See diploma thesis "Algorithmen zur Bestimmung von guten Graph-Einbettungen für orthogonale Zeichnungen" (in german) of Thorsten Kerkhof (2007) for details.
Copyright (C). All rights reserved. See README.txt in the root directory of the OGDF installation for details.
Definition in file EmbedderMaxFaceBiconnectedGraphsLayers.h.
Definition at line 55 of file EmbedderMaxFaceBiconnectedGraphsLayers.h.