51#ifdef OGDF_INCLUDE_CGAL
52# include <CGAL/Gmpq.h>
75 m_number_of_edge_samples = -1;
76 m_number_of_point_samples = 1;
77 m_neighborhood_threshold = -1;
78 m_within_region =
true;
103 m_neighborhood_threshold = threshold;
109 unsigned int m_number_of_edge_samples = -1;
110 unsigned int m_number_of_point_samples = 1;
111 unsigned int m_neighborhood_threshold = 100;
112 bool m_within_region =
true;
119#ifdef OGDF_INCLUDE_CGAL
127 m_number_of_edge_samples = 512;
128 m_number_of_point_samples = 1000;
129 m_neighborhood_threshold = 100;
130 m_within_region =
true;
137 m_number_of_edge_samples = 512;
138 m_number_of_point_samples = 1000;
139 m_neighborhood_threshold = 100;
140 m_within_region =
false;
Declaration of class GraphAttributes which extends a Graph by additional attributes.
Optimal Vertex Position interface.
CrossingMinimalPositionApx()
CrossingMinimalPositionApxWeighted()
Compute a crossing minimal position for a vertex.
void computePositionInOptimalRegion(const bool within_region)
If the value within_region is set to false, the algorithm samples points outside the optimal region.
CrossingMinimalPosition()
void setExactComputation()
~CrossingMinimalPosition()
void setNeighboorhoodThreshold(const unsigned int threshold)
The algortihm randomly partitions the neighbor of the vertex into blocks of size threshold.
unsigned int neighborThreshold() const
DPoint call(GraphAttributes &GA, node v)
computes a good position for the vertex v with respect to GA
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...
Stores additional attributes of a graph (like layout information).
Class for the representation of nodes.
Interface for computing a good / optimal vertex position.
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
static MultilevelBuilder * getDoubleFactoredZeroAdjustedMerger()
The namespace for all OGDF objects.