|
Open Graph Drawing Framework |
v. 2023.09 (Elderberry)
|
|
|
Go to the documentation of this file.
138 m_planarLayouter.reset(pPlanarLayouter);
155 int numberOfCrossings()
const {
return m_nCrossings; }
161 virtual void doCall(
const Graph& G, GridLayout& gridLayout,
IPoint& boundingBox)
override;
The namespace for all OGDF objects.
std::unique_ptr< CCLayoutPackModule > m_packer
The module for arranging connected components.
Declaration of classes GenericPoint, GenericPolyline, GenericLine, GenericSegment,...
The planarization grid layout algorithm.
Base class for crossing minimization algorithms.
Declaration of CrossingMinimization Module, an interface for crossing minimization algorithms.
std::unique_ptr< GridLayoutPlanRepModule > m_planarLayouter
The module for computing a planar grid layout.
double pageRatio() const
Returns the current setting of option pageRatio.
Base class of algorithms that arrange/pack layouts of connected components.
void pageRatio(double ratio)
Sets the option pageRatio to ratio.
double m_pageRatio
The desired page ratio.
GenericPoint< int > IPoint
Representing a two-dimensional point with integer coordinates.
Base class for grid layout algorithms operating on a PlanRep.
std::unique_ptr< CrossingMinimizationModule > m_crossMin
The module for computing a planar subgraph.
Declaration of interface for algorithms that arrange/pack layouts of connected components.
void setPacker(CCLayoutPackModule *pPacker)
Sets the module option for the arrangement of connected components.
void setPlanarLayouter(GridLayoutPlanRepModule *pPlanarLayouter)
Sets the module option for the planar grid layout algorithm.
Basic declarations, included by all source files.
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
int m_nCrossings
The number of crossings in the computed layout.
Base class for grid layout algorithms.
~PlanarizationGridLayout()
Declaration of interface for grid layout algorithms.