|
Open Graph Drawing Framework |
v. 2023.09 (Elderberry)
|
|
|
Go to the documentation of this file.
48 class GraphAttributes;
64 m_upPlanarizer.reset(upPlanarizer);
101 void constructVisibilityRepresentation(
const UpwardPlanRep& UPR);
The namespace for all OGDF objects.
Stores additional attributes of a graph (like layout information).
Includes declaration of graph class.
Takes an acyclic connected non-upward-planar graph and planarizes it, i.e., we obtain an upward-plana...
Declaration of interface for layout algorithms (class LayoutModule)
Declaration of class SubgraphUpwardPlanarizer.
RegisteredArray for nodes, edges and adjEntries of a graph.
Data type for general directed graphs (adjacency list representation).
RegisteredArray for labeling the faces of a CombinatorialEmbedding.
void setMinGridDistance(int dist)
EdgeArray< EdgeSegment > edgeToVis
NodeArray< NodeSegment > nodeToVis
void setUpwardPlanarizer(UpwardPlanarizerModule *upPlanarizer)
Basic declarations, included by all source files.
Declaration of CombinatorialEmbedding and face.
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
Declaration of UpwardPlanarizer Module, an interface for upward planarization algorithms.
Interface for upward planarization algorithms.
Upward planarized representations (of a connected component) of a graph.
std::unique_ptr< UpwardPlanarizerModule > m_upPlanarizer
Class for the representation of nodes.
RegisteredArray for edges of a graph, specialized for EdgeArray<edge>.
Interface of general layout algorithms.