Uses of Class
edu.wwu.tobikley.acgc.graphcoloring.ColoredGraph

Packages that use ColoredGraph

edu.wwu.tobikley.acgc.algorithms	Provides algorithms for counting the proper q-Colorings of an undirected graph.
edu.wwu.tobikley.acgc.graphcoloring	Provides a class that represents a colored graph.
edu.wwu.tobikley.acgc.mc	Provides the markov chains used by the algorithms for counting the proper q-Colorings of an undirected graph.

Uses of ColoredGraph in edu.wwu.tobikley.acgc.algorithms

Fields in edu.wwu.tobikley.acgc.algorithms declared as ColoredGraph

protected ColoredGraph

CountingAlgorithm.graphWorkingCopy A copy of the graph the algorithm will work with.

Uses of ColoredGraph in edu.wwu.tobikley.acgc.graphcoloring

Methods in edu.wwu.tobikley.acgc.graphcoloring that return ColoredGraph

ColoredGraph

ColoredGraph.copy()

Uses of ColoredGraph in edu.wwu.tobikley.acgc.mc

Methods in edu.wwu.tobikley.acgc.mc that return ColoredGraph

ColoredGraph	JerrumHeatBathChain.update(Object fromState)
ColoredGraph	JerrumChain.update(Object fromState)

Constructors in edu.wwu.tobikley.acgc.mc with parameters of type ColoredGraph

JerrumChain(RandomEngine randomEngine, ColoredGraph initialState, int numberOfColors)
Creates a new instance of the jerrum markov chain.

JerrumHeatBathChain(RandomEngine randomEngine, ColoredGraph initialState, int numberOfColors)
Creates a new instance of the jerrum heat bath markov chain.