The algorithm computes a planar embedding with minimum depth if the embedding for all blocks of the graph is given. For details see the paper "Minimum Depth Graph Drawing" by M. Pizzonia and R. Tamassia. More...
Go to the source code of this file.
Classes | |
| class | ogdf::EmbedderMinDepthPiTa |
| Planar graph embedding with minimum block-nesting depth for given embedded blocks. More... | |
Namespaces | |
| namespace | ogdf |
| The namespace for all OGDF objects. | |
Defines | |
| #define | OGDF_EMBEDDER_MIN_DEPTH_PITA_H |
| #define | USE_EXTENDED_DEPTH_DEFINITION |
The algorithm computes a planar embedding with minimum depth if the embedding for all blocks of the graph is given. For details see the paper "Minimum Depth Graph Drawing" by M. Pizzonia and R. Tamassia.
Copyright (C). All rights reserved. See README.txt in the root directory of the OGDF installation for details.
Definition in file EmbedderMinDepthPiTa.h.
| #define OGDF_EMBEDDER_MIN_DEPTH_PITA_H |
Definition at line 50 of file EmbedderMinDepthPiTa.h.
| #define USE_EXTENDED_DEPTH_DEFINITION |
Definition at line 52 of file EmbedderMinDepthPiTa.h.