This is the complete list of members for ogdf::NodeColoringSequential, including all inherited members.
call(const Graph &graph, NodeArray< NodeColor > &colors, NodeColor start=0) override | ogdf::NodeColoringSequential | inlinevirtual |
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 |
colorByDegree(const Graph &graph, NodeArray< NodeColor > &colors, NodeColor start=0) | ogdf::NodeColoringSequential | virtual |
colorByIndex(const Graph &graph, NodeArray< NodeColor > &colors, NodeColor start=0) | ogdf::NodeColoringSequential | virtual |
createBuckets(const Graph &graph, int size, Array< Array< node >> &buckets) const | ogdf::NodeColoringModule | protectedvirtual |
fromPermutation(const Graph &graph, NodeArray< NodeColor > &colors, List< node > &nodePermutation, NodeColor start=0, bool lookForNeighbors=false) | ogdf::NodeColoringSequential | virtual |
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 |
m_ramseyProcedure | ogdf::NodeColoringModule | protected |
mergeNodeLists(const Graph &graph, LISTITERATOR firstList, LISTITERATOR secondList, List< node > &mergedList) const | ogdf::NodeColoringModule | inlineprotected |
NodeColor typedef | ogdf::NodeColoringModule | |
NodeColoringModule() | ogdf::NodeColoringModule | inline |
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 |
sortByDegree(List< node > &nodes) | ogdf::NodeColoringSequential | virtual |
~NodeColoringModule() | ogdf::NodeColoringModule | inlinevirtual |