|
Open Graph Drawing Framework |
v. 2023.09 (Elderberry)
|
|
|
The namespace for all OGDF objects.
Includes declaration of graph class.
@ smallestDegree
Uses the node with the smallest degree.
const std::array< Color, 63 > colors
An array of 63 different colors to cycle through.
Approximation algorithms for the node coloring problem in graphs.
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.
Basic declarations, included by all source files.
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
RamseyProcedure m_ramseyProcedure
The RamseyProcedure to be used to select nodes.
RamseyProcedure
Declares the procedure of finding nodes in Ramsey's algorithm.