| call(const Graph &graph, NodeArray< NodeColor > &colors, NodeColor start=0) override | ogdf::NodeColoringHalldorsson | virtual |
| checkColoring(const Graph &graph, const NodeArray< NodeColor > &colors) const | ogdf::NodeColoringModule | virtual |
| checkIndependentSet(const Graph &graph, const CONTAINER &nodes) const | ogdf::NodeColoringModule | inlineprotected |
| cliqueRemoval(const Graph &graph, List< node > &independentSet) const | ogdf::NodeColoringModule | protectedvirtual |
| createBuckets(const Graph &graph, int size, Array< Array< node >> &buckets) const | ogdf::NodeColoringModule | protectedvirtual |
| getMaximumDegreeNode(const Graph &graph, node &maxDegreeNode) const | ogdf::NodeColoringModule | protectedvirtual |
| getMaximumDegreeNodes(const Graph &graph, List< node > &maxDegreeNodes) const | ogdf::NodeColoringModule | protectedvirtual |
| getMaximumNodeColor(NodeArray< NodeColor > &colors) | ogdf::NodeColoringModule | protectedvirtual |
| getMinimumDegreeNode(const Graph &graph, node &minDegreeNode) const | ogdf::NodeColoringModule | protectedvirtual |
| getMinimumDegreeNodes(const Graph &graph, List< node > &minDegreeNodes) const | ogdf::NodeColoringModule | protectedvirtual |
| getNeighborDegrees(const node &v) const | ogdf::NodeColoringModule | protected |
| getNeighbors(const Graph &graph, LISTITERATOR nodes, List< node > &neighbors) const | ogdf::NodeColoringModule | inlineprotected |
| getNeighborsComplement(const Graph &graph, LISTITERATOR nodes, List< node > &complementNeighbors) const | ogdf::NodeColoringModule | inlineprotected |
| halldorssonRecursive(const Graph &graph, List< node > &independentSet, int k, double alpha) | ogdf::NodeColoringHalldorsson | private |
| m_ramseyProcedure | ogdf::NodeColoringModule | protected |
| m_searchProcedure | ogdf::NodeColoringHalldorsson | private |
| mergeNodeLists(const Graph &graph, LISTITERATOR firstList, LISTITERATOR secondList, List< node > &mergedList) const | ogdf::NodeColoringModule | inlineprotected |
| NodeColor typedef | ogdf::NodeColoringModule | |
| NodeColoringHalldorsson() | ogdf::NodeColoringHalldorsson | inline |
| NodeColoringModule() | ogdf::NodeColoringModule | inline |
| performHalldorsson(const Graph &graph, List< node > &independentSet) | ogdf::NodeColoringHalldorsson | private |
| preprocessGraph(Graph &graph) const | ogdf::NodeColoringModule | inlinevirtual |
| ramseyAlgorithm(const Graph &graph, List< node > &clique, List< node > &independentSet) const | ogdf::NodeColoringModule | protectedvirtual |
| RamseyProcedure enum name | ogdf::NodeColoringModule | |
| reverseNodeTable(const Graph &graphOrig, const Graph &graphNew, const NodeArray< node > &orig2New, NodeArray< node > &new2Orig) const | ogdf::NodeColoringModule | protectedvirtual |
| searchBinary(SearchWrapper *searchWrapper, int start, int end) const | ogdf::NodeColoringModule | protected |
| searchLinear(SearchWrapper *searchWrapper, int start, int end) const | ogdf::NodeColoringModule | protected |
| SearchProcedure enum name | ogdf::NodeColoringModule | |
| searchWigderson(SearchWrapper *searchWrapper) const | ogdf::NodeColoringModule | protected |
| setSearchProcedure(SearchProcedure searchProcedure) | ogdf::NodeColoringHalldorsson | inline |
| ~NodeColoringModule() | ogdf::NodeColoringModule | inlinevirtual |
