|
Open Graph Drawing Framework |
v. 2023.09 (Elderberry)
|
|
|
Go to the documentation of this file.
41 class GraphAttributes;
42 struct ClusterStructure;
97 double minDistCircle()
const {
return m_minDistCircle; }
138 void assignClustersByBiconnectedComponents(ClusterStructure& C);
142 void computePreferedAngles(ClusterStructure& C,
const Array<double>& outerRadius,
145 void assignPrefAngle(ClusterStructure& C,
const Array<double>& outerRadius,
The namespace for all OGDF objects.
Stores additional attributes of a graph (like layout information).
Includes declaration of graph class.
void minDistCC(double x)
Sets the option minDistCC to x.
void pageRatio(double x)
Sets the option pageRatio to x.
void minDistSibling(double x)
Sets the option minDistSibling to x.
Declaration of interface for layout algorithms (class LayoutModule)
double m_minDistCC
The minimal distance between connected components.
double minDistLevel() const
Returns the option minDistLevel.
double pageRatio() const
Returns the option pageRatio.
double m_minDistLevel
The minimal distance between father and child circle.
double minDistCC() const
Returns the option minDistCC.
double m_minDistCircle
The minimal distance between nodes on a circle.
double m_pageRatio
The page ratio used for packing connected components.
double m_minDistSibling
The minimal distance between circles on same level.
void minDistLevel(double x)
Sets the option minDistLevel to x.
void minDistCircle(double x)
Sets the option minDistCircle to x.
Basic declarations, included by all source files.
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
The circular layout algorithm.
Declaration and implementation of Array class and Array algorithms.
double minDistSibling() const
Returns the option minDistSibling.
Class for the representation of nodes.
Interface of general layout algorithms.