|
Open Graph Drawing Framework |
v. 2023.09 (Elderberry)
|
|
|
Go to the documentation of this file.
49 class GraphAttributes;
99 void pageRatio(
double ratio) { m_pageRatio = ratio; }
137 m_planarLayouter.reset(pPlanarLayouter);
153 int numberOfCrossings()
const {
return m_nCrossings; }
The namespace for all OGDF objects.
Stores additional attributes of a graph (like layout information).
Includes declaration of graph class.
int minCliqueSize() const
Returns the current setting of option minCliqueSize.
Planarized representations (of a connected component) of a graph.
Declaration of classes GenericPoint, GenericPolyline, GenericLine, GenericSegment,...
The planarization approach for drawing graphs.
Base class for crossing minimization algorithms.
Declaration of CrossingMinimization Module, an interface for crossing minimization algorithms.
std::unique_ptr< CCLayoutPackModule > m_packer
The module for arranging connected components.
Declaration of interface for layout algorithms (class LayoutModule)
void minCliqueSize(int i)
Set the option minCliqueSize to i.
Base class of algorithms that arrange/pack layouts of connected components.
std::unique_ptr< LayoutPlanRepModule > m_planarLayouter
The module for computing a planar layout.
std::unique_ptr< CrossingMinimizationModule > m_crossMin
The module for computing a planar subgraph.
void setPlanarLayouter(LayoutPlanRepModule *pPlanarLayouter)
Sets the module option for the planar layout algorithm.
Stores a layout of a graph (coordinates of nodes, bend points of edges).
int m_nCrossings
The number of crossings in the computed layout.
The parameterized class Array implements dynamic arrays of type E.
int m_cliqueSize
The minimum size of cliques to search for.
Interface for planar layout algorithms (used in the planarization approach).
Declaration of interface for algorithms that arrange/pack layouts of connected components.
void setEmbedder(EmbedderModule *pEmbedder)
Sets the module option for the graph embedding algorithm.
Doubly linked lists (maintaining the length of the list).
RegisteredArray for nodes, edges and adjEntries of a graph.
Data type for general directed graphs (adjacency list representation).
Handling of clique replacement in planarization layout.
double pageRatio() const
Returns the current setting of option pageRatio.
std::unique_ptr< EmbedderModule > m_embedder
The module for planar embedding.
Base class for embedder algorithms.
Basic declarations, included by all source files.
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
Defines ogdf::EmbedderModule.
double m_pageRatio
The desired page ratio.
Declaration and implementation of Array class and Array algorithms.
Declaration of interface for planar layout algorithms (used in planarization approach).
~PlanarizationLayout()
Destructor.
Class for the representation of nodes.
void setPacker(CCLayoutPackModule *pPacker)
Sets the module option for the arrangement of connected components.
void pageRatio(double ratio)
Sets the option pageRatio to ratio.
Interface of general layout algorithms.