54 if (
GA.constGraph().numberOfNodes() > 2) {
Declaration of upward planarization layout algorithm.
Declaration of interface for layout algorithms (class LayoutModule)
Declaration of class SubgraphUpwardPlanarizer.
Declaration of a base class for planar representations of graphs and cluster graphs.
Stores additional attributes of a graph (like layout information).
void createEmpty(const Graph &G)
Associates the graph copy with G, but does not create any nodes or edges.
Interface of general layout algorithms.
Takes an acyclic connected non-upward-planar graph and planarizes it, i.e., we obtain an upward-plana...
Interface of hierarchy layout algorithms.
Upward planarized representations (of a connected component) of a graph.
std::unique_ptr< UPRLayoutModule > m_layout
int numberOfLevels() const
void setUpwardPlanarizer(UpwardPlanarizerModule *pUpwardPlanarizer)
int numberOfCrossings() const
virtual void call(GraphAttributes &GA) override
Computes a layout of graph GA.
void setUPRLayout(UPRLayoutModule *pLayout)
std::unique_ptr< UpwardPlanarizerModule > m_UpwardPlanarizer
UpwardPlanarizationLayout()
Interface for upward planarization algorithms.
static MultilevelBuilder * getDoubleFactoredZeroAdjustedMerger()
The namespace for all OGDF objects.