Template of base class of node coloring algorithms. More...
#include <ogdf/basic/Array.h>#include <ogdf/basic/Graph.h>#include <ogdf/basic/GraphList.h>#include <ogdf/basic/GraphSets.h>#include <ogdf/basic/List.h>#include <ogdf/basic/basic.h>#include <ogdf/basic/simple_graph_alg.h>Go to the source code of this file.
Classes | |
| class | ogdf::NodeColoringModule |
| Approximation algorithms for the node coloring problem in graphs. More... | |
| struct | ogdf::NodeColoringModule::SearchWrapper |
| Wraps the search for the minimum parameter k so that the same code can be reused for all algorithms. More... | |
| struct | ogdf::NodeColoringModule::SubsetIterator |
| Struct to iterate over all node subsets of a given size. More... | |
Namespaces | |
| namespace | ogdf |
| The namespace for all OGDF objects. | |
Template of base class of node coloring algorithms.
Definition in file NodeColoringModule.h.