|
|||
|
|
|
|||
|
|
Interface for planar cluster layout algorithms. More...
#include <ogdf/module/LayoutClusterPlanRepModule.h>
Public Member Functions | |
| LayoutClusterPlanRepModule () | |
| Initializes a cluster planar layout module. | |
| virtual | ~LayoutClusterPlanRepModule () |
| virtual void | call (ClusterPlanRep &PG, adjEntry adjExternal, Layout &drawing, List< NodePair > &npEdges, List< edge > &newEdges, Graph &originalGraph)=0 |
| const DPoint & | getBoundingBox () const |
| Returns the bounding box of the computed layout. | |
| virtual void | setOptions (int) |
| Sets the (generic) options; derived classes have to cope with the interpretation). | |
| virtual int | getOptions () |
| Returns the (generic) options. | |
| virtual double | separation () const =0 |
| Returns the minimal allowed distance between edges and vertices. | |
| virtual void | separation (double sep)=0 |
| Sets the minimal allowed distance between edges and vertices to sep. | |
| void * | operator new (size_t nBytes) |
| void * | operator new (size_t, void *p) |
| void | operator delete (void *p, size_t nBytes) |
Protected Attributes | |
| DPoint | m_boundingBox |
| Stores the bounding box of the computed layout. Must be set by derived algorithms! | |
Interface for planar cluster layout algorithms.
Definition at line 78 of file LayoutClusterPlanRepModule.h.
| ogdf::LayoutClusterPlanRepModule::LayoutClusterPlanRepModule | ( | ) | [inline] |
Initializes a cluster planar layout module.
Definition at line 81 of file LayoutClusterPlanRepModule.h.
| virtual ogdf::LayoutClusterPlanRepModule::~LayoutClusterPlanRepModule | ( | ) | [inline, virtual] |
Definition at line 83 of file LayoutClusterPlanRepModule.h.
| virtual void ogdf::LayoutClusterPlanRepModule::call | ( | ClusterPlanRep & | PG, | |
| adjEntry | adjExternal, | |||
| Layout & | drawing, | |||
| List< NodePair > & | npEdges, | |||
| List< edge > & | newEdges, | |||
| Graph & | originalGraph | |||
| ) | [pure virtual] |
Computes a layout of PG in drawing.
Must be overridden by derived classes.
| PG | is the input cluster planarized representation which may be modified. | |
| adjExternal | is an adjacenty entry on the external face. | |
| drawing | is the computed layout of PG. | |
| newEdges | ||
| originalGraph |
Implemented in ogdf::ClusterOrthoLayout.
| const DPoint& ogdf::LayoutClusterPlanRepModule::getBoundingBox | ( | ) | const [inline] |
Returns the bounding box of the computed layout.
Definition at line 103 of file LayoutClusterPlanRepModule.h.
| virtual int ogdf::LayoutClusterPlanRepModule::getOptions | ( | ) | [inline, virtual] |
Returns the (generic) options.
Definition at line 111 of file LayoutClusterPlanRepModule.h.
| void ogdf::LayoutClusterPlanRepModule::operator delete | ( | void * | p, | |
| size_t | nBytes | |||
| ) | [inline] |
Definition at line 127 of file LayoutClusterPlanRepModule.h.
| void* ogdf::LayoutClusterPlanRepModule::operator new | ( | size_t | , | |
| void * | p | |||
| ) | [inline] |
Definition at line 127 of file LayoutClusterPlanRepModule.h.
| void* ogdf::LayoutClusterPlanRepModule::operator new | ( | size_t | nBytes | ) | [inline] |
Definition at line 127 of file LayoutClusterPlanRepModule.h.
| virtual void ogdf::LayoutClusterPlanRepModule::separation | ( | double | sep | ) | [pure virtual] |
Sets the minimal allowed distance between edges and vertices to sep.
Implemented in ogdf::ClusterOrthoLayout.
| virtual double ogdf::LayoutClusterPlanRepModule::separation | ( | ) | const [pure virtual] |
Returns the minimal allowed distance between edges and vertices.
Implemented in ogdf::ClusterOrthoLayout.
| virtual void ogdf::LayoutClusterPlanRepModule::setOptions | ( | int | ) | [inline, virtual] |
Sets the (generic) options; derived classes have to cope with the interpretation).
Reimplemented in ogdf::ClusterOrthoLayout.
Definition at line 108 of file LayoutClusterPlanRepModule.h.
Stores the bounding box of the computed layout. Must be set by derived algorithms!
Definition at line 124 of file LayoutClusterPlanRepModule.h.
