|
Open Graph Drawing Framework |
v. 2023.09 (Elderberry)
|
|
|
Go to the documentation of this file.
56 sequentialColoringSimple,
57 sequentialColoringDegree,
70 , m_sequentialColoring()
72 , m_wigdersonColoring()
73 , m_searchProcedure(SearchProcedure::wigdersonSearch)
83 m_searchProcedure = searchProcedure;
91 m_bruteForceProcedure = bruteForceProcedure;
106 NodeColor start = 0)
override;
133 : m_coloring(coloringBergerRompel), m_graph(graph), m_colors(
colors), m_alpha(alpha) { }
137 return m_coloring.bergerRompelParameterized(m_graph, m_colors, start, k, m_alpha);
void setBruteForceProcedure(BruteForceProcedure bruteForceProcedure)
Sets the brute force procedure.
The namespace for all OGDF objects.
BruteForceProcedure m_bruteForceProcedure
NodeColoringBergerRompel & m_coloring
Includes declaration of graph class.
#define OGDF_ASSERT(expr)
Assert condition expr. See doc/build.md for more information.
NodeArray< NodeColor > & m_colors
NodeColoringWigderson m_wigdersonColoring
Applies the node coloring approximation specified by Johnson.
Wraps the parameterized Berger&Rompel algorithm.
bool step(int k) override
Performs a step in the search procedure.
Approximation algorithms for the node coloring problem in graphs.
Approximation algorithms for the node coloring problem in graphs.
const std::array< Color, 63 > colors
An array of 63 different colors to cycle through.
NodeColoringSequential m_sequentialColoring
Approximation algorithms for the node coloring problem in graphs.
Approximation algorithms for the node coloring problem in graphs.
void setAlpha(double alpha)
Sets the parameter alpha which controls the accuracy of the algorithm.
RegisteredArray for nodes, edges and adjEntries of a graph.
Trivial node coloring which assigns every node a different color.
Data type for general directed graphs (adjacency list representation).
Template of base class of node coloring algorithms.
SearchProcedure m_searchProcedure
Approximation algorithms for the node coloring problem in graphs.
SearchWrapperBergerRompel(NodeColoringBergerRompel &coloringBergerRompel, const Graph &graph, NodeArray< NodeColor > &colors, double alpha)
Creates the wrapper.
NodeColoringSimple m_simpleColoring
NodeColoringJohnson m_johnsonColoring
Basic declarations, included by all source files.
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
unsigned int NodeColor
Data type of the node colors.
Applies the sequential coloring algorithm to a given graph.
NodeColoringBergerRompel()
The constructor.
void setSearchProcedure(SearchProcedure searchProcedure)
Sets the search procedure to find the smallest possible parameter k such as the graph is k-colorable.
Approximation algorithms for the node coloring problem in graphs.
BruteForceProcedure
Declares the procedure dealing with the brute force coloring.
Applies the node coloring approximation specified by Wigderson.
Wraps the search for the minimum parameter k so that the same code can be reused for all algorithms.