64 m_upPlanarizer.reset(upPlanarizer);
Declaration of CombinatorialEmbedding and face.
Includes declaration of graph class.
Declaration of interface for layout algorithms (class LayoutModule)
Declaration of class SubgraphUpwardPlanarizer.
Declaration of UpwardPlanarizer Module, an interface for upward planarization algorithms.
Basic declarations, included by all source files.
RegisteredArray for labeling the faces of a CombinatorialEmbedding.
Stores additional attributes of a graph (like layout information).
Data type for general directed graphs (adjacency list representation).
Interface of general layout algorithms.
Class for the representation of nodes.
Takes an acyclic connected non-upward-planar graph and planarizes it, i.e., we obtain an upward-plana...
Upward planarized representations (of a connected component) of a graph.
Interface for upward planarization algorithms.
virtual void call(GraphAttributes &GA) override
Computes a layout of graph GA.
std::unique_ptr< UpwardPlanarizerModule > m_upPlanarizer
void constructVisibilityRepresentation(const UpwardPlanRep &UPR)
void setUpwardPlanarizer(UpwardPlanarizerModule *upPlanarizer)
void setMinGridDistance(int dist)
EdgeArray< EdgeSegment > edgeToVis
void constructDualGraph(const UpwardPlanRep &UPR, Graph &D, node &s_D, node &t_D, FaceArray< node > &faceToNode, NodeArray< face > &leftFace_node, NodeArray< face > &rightFace_node, EdgeArray< face > &leftFace_edge, EdgeArray< face > &rightFace_edge)
NodeArray< NodeSegment > nodeToVis
void layout(GraphAttributes &GA, const UpwardPlanRep &UPROrig)
RegisteredArray for edges of a graph, specialized for EdgeArray<edge>.
RegisteredArray for nodes, edges and adjEntries of a graph.
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF dynamic library (shared object / DLL),...
The namespace for all OGDF objects.