55#ifdef OGDF_INCLUDE_CGAL
56# include <CGAL/Gmpq.h>
91 const unsigned int number_of_point_samples) {
127#ifdef OGDF_INCLUDE_CGAL
136 m_number_of_edge_samples = 512;
137 m_number_of_point_samples = 1000;
138 m_neighborhood_threshold = 100;
139 m_within_region =
true;
146 m_number_of_edge_samples = 512;
147 m_number_of_point_samples = 1000;
148 m_neighborhood_threshold = 100;
149 m_within_region =
false;
Includes declaration of graph class.
Optimal Vertex Position interface.
Declaration of classes GenericPoint, GenericPolyline, GenericLine, GenericSegment,...
Basic declarations, included by all source files.
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()
unsigned int m_number_of_edge_samples
~CrossingMinimalPosition()
void setNeighboorhoodThreshold(const unsigned int threshold)
The algortihm randomly partitions the neighbor of the vertex into blocks of size threshold.
unsigned int m_number_of_point_samples
unsigned int neighborThreshold() const
DPoint call(GraphAttributes &GA, node v)
computes a good position for the vertex v with respect to GA
unsigned int m_neighborhood_threshold
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_TEMPL_DECL
If you declare a template in a header file, but only provide a definition for its implementation in a...
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF dynamic library (shared object / DLL),...
The namespace for all OGDF objects.