Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

ogdf::NodeColoringBergerRompel Member List

This is the complete list of members for ogdf::NodeColoringBergerRompel, including all inherited members.

bergerRompelParameterized(const Graph &graph, NodeArray< NodeColor > &colors, NodeColor &color, int k, double alpha)ogdf::NodeColoringBergerRompelprivate
BruteForceProcedure enum nameogdf::NodeColoringBergerRompel
call(const Graph &graph, NodeArray< NodeColor > &colors, NodeColor start=0) overrideogdf::NodeColoringBergerRompelvirtual
checkColoring(const Graph &graph, const NodeArray< NodeColor > &colors) constogdf::NodeColoringModulevirtual
checkIndependentSet(const Graph &graph, const CONTAINER &nodes) constogdf::NodeColoringModuleinlineprotected
cliqueRemoval(const Graph &graph, List< node > &independentSet) constogdf::NodeColoringModuleprotectedvirtual
createBuckets(const Graph &graph, int size, Array< Array< node >> &buckets) constogdf::NodeColoringModuleprotectedvirtual
getMaximumDegreeNode(const Graph &graph, node &maxDegreeNode) constogdf::NodeColoringModuleprotectedvirtual
getMaximumDegreeNodes(const Graph &graph, List< node > &maxDegreeNodes) constogdf::NodeColoringModuleprotectedvirtual
getMaximumNodeColor(NodeArray< NodeColor > &colors)ogdf::NodeColoringModuleprotectedvirtual
getMinimumDegreeNode(const Graph &graph, node &minDegreeNode) constogdf::NodeColoringModuleprotectedvirtual
getMinimumDegreeNodes(const Graph &graph, List< node > &minDegreeNodes) constogdf::NodeColoringModuleprotectedvirtual
getNeighborDegrees(const node &v) constogdf::NodeColoringModuleprotected
getNeighbors(const Graph &graph, LISTITERATOR nodes, List< node > &neighbors) constogdf::NodeColoringModuleinlineprotected
getNeighborsComplement(const Graph &graph, LISTITERATOR nodes, List< node > &complementNeighbors) constogdf::NodeColoringModuleinlineprotected
m_alphaogdf::NodeColoringBergerRompelprivate
m_bruteForceProcedureogdf::NodeColoringBergerRompelprivate
m_johnsonColoringogdf::NodeColoringBergerRompelprivate
m_ramseyProcedureogdf::NodeColoringModuleprotected
m_searchProcedureogdf::NodeColoringBergerRompelprivate
m_sequentialColoringogdf::NodeColoringBergerRompelprivate
m_simpleColoringogdf::NodeColoringBergerRompelprivate
m_wigdersonColoringogdf::NodeColoringBergerRompelprivate
mergeNodeLists(const Graph &graph, LISTITERATOR firstList, LISTITERATOR secondList, List< node > &mergedList) constogdf::NodeColoringModuleinlineprotected
NodeColor typedefogdf::NodeColoringModule
NodeColoringBergerRompel()ogdf::NodeColoringBergerRompelinline
NodeColoringModule()ogdf::NodeColoringModuleinline
preprocessGraph(Graph &graph) constogdf::NodeColoringModuleinlinevirtual
ramseyAlgorithm(const Graph &graph, List< node > &clique, List< node > &independentSet) constogdf::NodeColoringModuleprotectedvirtual
RamseyProcedure enum nameogdf::NodeColoringModule
reverseNodeTable(const Graph &graphOrig, const Graph &graphNew, const NodeArray< node > &orig2New, NodeArray< node > &new2Orig) constogdf::NodeColoringModuleprotectedvirtual
searchBinary(SearchWrapper *searchWrapper, int start, int end) constogdf::NodeColoringModuleprotected
searchLinear(SearchWrapper *searchWrapper, int start, int end) constogdf::NodeColoringModuleprotected
SearchProcedure enum nameogdf::NodeColoringModule
searchWigderson(SearchWrapper *searchWrapper) constogdf::NodeColoringModuleprotected
setAlpha(double alpha)ogdf::NodeColoringBergerRompelinline
setBruteForceProcedure(BruteForceProcedure bruteForceProcedure)ogdf::NodeColoringBergerRompelinline
setSearchProcedure(SearchProcedure searchProcedure)ogdf::NodeColoringBergerRompelinline
~NodeColoringModule()ogdf::NodeColoringModuleinlinevirtual