Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

Loading...
Searching...
No Matches
LayoutClusterPlanRepModule.h
Go to the documentation of this file.
1
33#pragma once
34
35#include <ogdf/basic/Graph.h>
36#include <ogdf/basic/basic.h>
37#include <ogdf/basic/geometry.h>
38#include <ogdf/basic/memory.h>
39
40namespace ogdf {
41class ClusterPlanRep;
42class Layout;
43template<class E>
44class List;
45
53public:
56
58
68 virtual void call(ClusterPlanRep& PG, adjEntry adjExternal, Layout& drawing,
69 List<edge>& origEdges, Graph& originalGraph) = 0;
70
72 const DPoint& getBoundingBox() const { return m_boundingBox; }
73
75 virtual void setOptions(int /* optionField */) { }
76
77 // don't make it abstract!
78
80 virtual int getOptions() { return 0; }
81
82 // don't make it abstract!
83
85 virtual double separation() const = 0;
86
88 virtual void separation(double sep) = 0;
89
90protected:
96
98};
99
100}
Includes declaration of graph class.
Declaration of classes GenericPoint, GenericPolyline, GenericLine, GenericSegment,...
Basic declarations, included by all source files.
Class for adjacency list elements.
Definition Graph_d.h:143
Planarized representations for clustered graphs.
Data type for general directed graphs (adjacency list representation).
Definition Graph_d.h:866
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)
DPoint m_boundingBox
Stores the bounding box of the computed layout.
Stores a layout of a graph (coordinates of nodes, bend points of edges).
Definition Layout.h:49
Doubly linked lists (maintaining the length of the list).
Definition List.h:1451
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF dynamic library (shared object / DLL),...
Definition config.h:117
#define OGDF_MALLOC_NEW_DELETE
Makes the class use malloc for memory allocation.
Definition memory.h:92
Declaration of memory manager for allocating small pieces of memory.
The namespace for all OGDF objects.