Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

Loading...
Searching...
No Matches
NodeColoringBoppanaHalldorsson.h
Go to the documentation of this file.
1
32#pragma once
33
34#include <ogdf/basic/Graph.h>
35#include <ogdf/basic/basic.h>
37
38namespace ogdf {
39
46public:
52 NodeColoringModule::m_ramseyProcedure = NodeColoringModule::RamseyProcedure::smallestDegree;
53 }
54
59 inline void setRamseyProcedure(RamseyProcedure ramseyProcedure) {
60 NodeColoringModule::m_ramseyProcedure = ramseyProcedure;
61 }
62
63 virtual NodeColor call(const Graph& graph, NodeArray<NodeColor>& colors,
64 NodeColor start = 0) override;
65};
66}
Includes declaration of graph class.
Template of base class of node coloring algorithms.
Basic declarations, included by all source files.
Data type for general directed graphs (adjacency list representation).
Definition Graph_d.h:866
Approximation algorithms for the node coloring problem in graphs.
virtual NodeColor call(const Graph &graph, NodeArray< NodeColor > &colors, NodeColor start=0) override
The actual algorithm call.
void setRamseyProcedure(RamseyProcedure ramseyProcedure)
Sets the Ramsey-procedure of findings nodes to a specific value.
Approximation algorithms for the node coloring problem in graphs.
unsigned int NodeColor
Data type of the node colors.
RamseyProcedure
Declares the procedure of finding nodes in Ramsey's algorithm.
RegisteredArray for nodes, edges and adjEntries of a graph.
Definition Graph_d.h:659
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF dynamic library (shared object / DLL),...
Definition config.h:117
The namespace for all OGDF objects.