Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

Loading...
Searching...
No Matches
NodeColoringRecursiveLargestFirst.h
Go to the documentation of this file.
1
33#pragma once
34
35#include <ogdf/basic/Graph.h>
36#include <ogdf/basic/basic.h>
38
39namespace ogdf {
40
46public:
47 virtual NodeColor call(const Graph& graph, NodeArray<NodeColor>& colors,
48 NodeColor start = 0) override;
49
50private:
57 void getCandidate(node& candidate, NodeArray<int>& degreesUnavailable, Graph& graph);
58};
59}
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.
unsigned int NodeColor
Data type of the node colors.
A simple greedy node coloring heuristic in graphs.
virtual NodeColor call(const Graph &graph, NodeArray< NodeColor > &colors, NodeColor start=0) override
The actual algorithm call.
void getCandidate(node &candidate, NodeArray< int > &degreesUnavailable, Graph &graph)
Searches a node candidate for the next coloring step.
Class for the representation of nodes.
Definition Graph_d.h:241
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.