|
Open Graph Drawing Framework |
v. 2023.09 (Elderberry)
|
|
|
Go to the documentation of this file.
116 int& crossingNumber)
override;
154 #ifndef OGDF_MEMORY_POOL_NTS
161 std::minstd_rand& rng);
165 int& crossingNumber);
The namespace for all OGDF objects.
Includes declaration of graph class.
void permutations(int p)
Sets the number of permutations to p.
Planarized representation (of a connected component) of a UMLGraph; allows special handling of hierar...
void setSubgraph(PlanarSubgraphModule< int > *pSubgraph)
Sets the module option for the computation of the planar subgraph.
int permutations()
Returns the number of permutations.
Light-weight version of a planarized representation, associated with a PlanRep.
Interface for UML edge insertion algorithms.
int m_permutations
The number of permutations.
void maxThreads(unsigned int n)
Sets the maximal number of used threads to n.
void setTimeout(bool b)
Sets the option setTimeout to b.
Contains logging functionality.
Declaration of interface for edge insertion algorithms.
Base class for UML crossing minimization algorithms.
bool m_setTimeout
The option for setting timeouts in submodules.
unsigned int m_maxThreads
The maximal number of used threads.
Declaration of interface for planar subgraph algorithms.
std::unique_ptr< UMLEdgeInsertionModule > m_inserter
The edge insertion module.
The parameterized class Array implements dynamic arrays of type E.
The planarization approach for UML crossing minimization.
bool setTimeout()
Returns the current setting of options setTimeout.
Declaration of CrossingMinimization Module, an interface for crossing minimization algorithms.
Basic declarations, included by all source files.
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
Declaration and implementation of Array class and Array algorithms.
Centralized global and local logging facility working on streams like std::cout.
ReturnType
The return type of a module.
unsigned int maxThreads() const
Returns the maximal number of used threads.
std::unique_ptr< PlanarSubgraphModule< int > > m_subgraph
The planar subgraph algorithm.
void setInserter(UMLEdgeInsertionModule *pInserter)
Sets the module option for the edge insertion module.
RegisteredArray for edges of a graph, specialized for EdgeArray<edge>.