|
Open Graph Drawing Framework |
v. 2023.09 (Elderberry)
|
|
|
Go to the documentation of this file.
55 #ifdef OGDF_INCLUDE_CGAL
56 # include <CGAL/Gmpq.h>
60 class GraphAttributes;
80 m_number_of_edge_samples = -1;
81 m_number_of_point_samples = 1;
82 m_neighborhood_threshold = -1;
83 m_within_region =
true;
91 const unsigned int number_of_point_samples) {
92 m_number_of_edge_samples = number_of_edge_samples;
93 m_number_of_point_samples = number_of_point_samples;
100 m_within_region = within_region;
108 m_neighborhood_threshold = threshold;
114 unsigned int m_number_of_edge_samples = -1;
115 unsigned int m_number_of_point_samples = 1;
116 unsigned int m_neighborhood_threshold = 100;
117 bool m_within_region =
true;
124 #ifdef OGDF_INCLUDE_CGAL
132 m_number_of_edge_samples = 512;
133 m_number_of_point_samples = 1000;
134 m_neighborhood_threshold = 100;
135 m_within_region =
true;
142 m_number_of_edge_samples = 512;
143 m_number_of_point_samples = 1000;
144 m_neighborhood_threshold = 100;
145 m_within_region =
false;
The namespace for all OGDF objects.
Stores additional attributes of a graph (like layout information).
Includes declaration of graph class.
Optimal Vertex Position interface.
Declaration of classes GenericPoint, GenericPolyline, GenericLine, GenericSegment,...
void setSampleSize(const unsigned int number_of_edge_samples, const unsigned int number_of_point_samples)
set the number of edges that are randomly selected to compute the new vertex postion and the number o...
Compute a crossing minimal position for a vertex.
CrossingMinimalPositionApxWeighted()
~CrossingMinimalPosition()
Interface for computing a good / optimal vertex position.
CrossingMinimalPosition()
CrossingMinimalPositionApx()
Basic declarations, included by all source files.
void setNeighboorhoodThreshold(const unsigned int threshold)
The algortihm randomly partitions the neighbor of the vertex into blocks of size threshold.
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
unsigned int neighborThreshold() const
void computePositionInOptimalRegion(const bool within_region)
If the value within_region is set to false, the algorithm samples points outside the optimal region.
Class for the representation of nodes.
void setExactComputation()