91 m_boundingBox =
drawing.computeBoundingBox(
PG);
Declaration of class Layout.
Declaration of a base class for planar representations of graphs and cluster graphs.
Class for adjacency list elements.
Stores a layout of a graph (coordinates of nodes, bend points of edges).
Interface for planar layout algorithms (used in the planarization approach).
virtual double separation() const =0
Returns the minimal allowed distance between edges and vertices.
DPoint m_boundingBox
Stores the bounding box of the computed layout.
const DPoint & getBoundingBox() const
Returns the bounding box of the computed layout.
void setBoundingBox(PlanRep &PG, Layout &drawing)
Computes and sets the bounding box variable m_boundingBox.
virtual ~LayoutPlanRepModule()
Destructor.
virtual void separation(double sep)=0
Sets the minimal allowed distance between edges and vertices to sep.
virtual void call(PlanRep &PG, adjEntry adjExternal, Layout &drawing)=0
Computes a planar layout of PG in drawing.
LayoutPlanRepModule()
Initializes a planar layout module.
void operator()(PlanRep &PG, adjEntry adjExternal, Layout &drawing)
Computes a planar layout of PG in drawing.
Planarized representations (of a connected component) of a graph.
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
#define OGDF_MALLOC_NEW_DELETE
Makes the class use malloc for memory allocation.
static MultilevelBuilder * getDoubleFactoredZeroAdjustedMerger()
The namespace for all OGDF objects.