Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

NodeColoringRecursiveLargestFirst.h
Go to the documentation of this file.
1 
33 #pragma once
34 
36 
37 namespace ogdf {
38 
44 public:
45  virtual NodeColor call(const Graph& graph, NodeArray<NodeColor>& colors,
46  NodeColor start = 0) override;
47 
48 private:
55  void getCandidate(node& candidate, NodeArray<int>& degreesUnavailable, Graph& graph);
56 };
57 }
ogdf::NodeColoringRecursiveLargestFirst
A simple greedy node coloring heuristic in graphs.
Definition: NodeColoringRecursiveLargestFirst.h:43
ogdf
The namespace for all OGDF objects.
Definition: AugmentationModule.h:36
ogdf::colors
const std::array< Color, 63 > colors
An array of 63 different colors to cycle through.
ogdf::NodeColoringModule
Approximation algorithms for the node coloring problem in graphs.
Definition: NodeColoringModule.h:44
ogdf::internal::GraphRegisteredArray
RegisteredArray for nodes, edges and adjEntries of a graph.
Definition: Graph_d.h:651
ogdf::Graph
Data type for general directed graphs (adjacency list representation).
Definition: Graph_d.h:862
NodeColoringModule.h
Template of base class of node coloring algorithms.
OGDF_EXPORT
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
Definition: config.h:101
ogdf::NodeColoringModule::NodeColor
unsigned int NodeColor
Data type of the node colors.
Definition: NodeColoringModule.h:49
ogdf::NodeElement
Class for the representation of nodes.
Definition: Graph_d.h:233