59 m_angle = Math::degreesToRadians(45.0);
67 m_upPlanarizer.reset(upPlanarizer);
Includes declaration of graph class.
Declaration of interface for layout algorithms (class LayoutModule)
Declaration of doubly linked lists and iterators.
Declaration of class SubgraphUpwardPlanarizer.
Declaration of UpwardPlanarizer Module, an interface for upward planarization algorithms.
Basic declarations, included by all source files.
NodeArray< edge > lastout
NodeArray< int > yPreCoord
std::unique_ptr< UpwardPlanarizerModule > m_upPlanarizer
void labelX(const UpwardPlanRep &UPR, node v, int &count)
NodeArray< edge > firstout
virtual void call(GraphAttributes &GA) override
Computes a layout of graph GA.
void compact(const UpwardPlanRep &UPR, GraphAttributes &GA)
NodeArray< int > xPreCoord
void setUpwardPlanarizer(UpwardPlanarizerModule *upPlanarizer)
NodeArray< edge > firstin
void layout(GraphAttributes &GA, const UpwardPlanRep &UPROrig)
void setMinGridDistance(int dist)
void labelY(const UpwardPlanRep &UPR, node v, int &count)
void findTransitiveEdges(const UpwardPlanRep &UPR, List< edge > &edges)
Stores additional attributes of a graph (like layout information).
Interface of general layout algorithms.
Doubly linked lists (maintaining the length of the list).
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.
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.