|
Open Graph Drawing Framework |
v. 2023.09 (Elderberry)
|
|
|
Go to the documentation of this file.
69 m_minDegreeProcedure = minDegreeProcedure;
73 NodeColor start = 0)
override;
The namespace for all OGDF objects.
Includes declaration of graph class.
const std::array< Color, 63 > colors
An array of 63 different colors to cycle through.
MinDegreeProcedure m_minDegreeProcedure
NodeColoringJohnson()
The constructor.
Approximation algorithms for the node coloring problem in graphs.
void setMinDegreeProcedure(MinDegreeProcedure minDegreeProcedure)
Sets the procedure of finding minimum degree nodes.
RegisteredArray for nodes, edges and adjEntries of a graph.
Data type for general directed graphs (adjacency list representation).
Template of base class of node coloring algorithms.
Approximation algorithms for the node coloring problem in graphs.
Basic declarations, included by all source files.
MinDegreeProcedure
Declares procedure to find the minimum degree nodes.
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.