Declaration of ClusterPlanRep class, allowing cluster boundary insertion and shortest path edge inser...
Declaration of class Layout.
Class for adjacency list elements.
Planarized representations for clustered graphs.
Data type for general directed graphs (adjacency list representation).
Interface for planar cluster layout algorithms.
virtual int getOptions()
Returns the (generic) options.
virtual void call(ClusterPlanRep &PG, adjEntry adjExternal, Layout &drawing, List< edge > &origEdges, Graph &originalGraph)=0
Computes a layout of PG in drawing.
virtual double separation() const =0
Returns the minimal allowed distance between edges and vertices.
LayoutClusterPlanRepModule()
Initializes a cluster planar layout module.
const DPoint & getBoundingBox() const
Returns the bounding box of the computed layout.
virtual void separation(double sep)=0
Sets the minimal allowed distance between edges and vertices to sep.
virtual void setOptions(int)
Sets the (generic) options; derived classes have to cope with the interpretation)
virtual ~LayoutClusterPlanRepModule()
DPoint m_boundingBox
Stores the bounding box of the computed layout.
Stores a layout of a graph (coordinates of nodes, bend points of edges).
Doubly linked lists (maintaining the length of the list).
#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.