|
Open Graph Drawing Framework |
v. 2023.09 (Elderberry)
|
|
|
Go to the documentation of this file.
52 return colorByDegree(graph,
colors, start);
95 List<node>& nodePermutation, NodeColor start = 0,
bool lookForNeighbors =
false);
The namespace for all OGDF objects.
Class for comparing two nodes by the node degree.
Includes declaration of graph class.
virtual NodeColor call(const Graph &graph, NodeArray< NodeColor > &colors, NodeColor start=0) override
The actual algorithm call.
#define OGDF_ASSERT(expr)
Assert condition expr. See doc/build.md for more information.
#define OGDF_AUGMENT_STATICCOMPARER(type)
Add this macro to your class to turn it into a full static comparer.
static int compare(const node &v1, const node &v2)
Compares two nodes by using the node degree.
const std::array< Color, 63 > colors
An array of 63 different colors to cycle through.
int degree() const
Returns the degree of the node (indegree + outdegree).
Approximation algorithms for the node coloring problem in graphs.
Approximation algorithms for the node coloring problem in graphs.
Doubly linked lists (maintaining the length of the list).
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.
unsigned int NodeColor
Data type of the node colors.
const Graph * graphOf() const
Returns the graph containing this node (debug only).
Declarations for Comparer objects.
Class for the representation of nodes.