Package edu.wwu.tobikley.acgc.algorithms

Provides algorithms for counting the proper q-Colorings of an undirected graph.

See:
Description

Class Summary

ApproximateCountingAlgorithm	Basic functionality of a randomized approximation scheme for the q-Colorings of a graph.
CountingAlgorithm	Basic functionality of an algorithm to count the q-Colorings of a graph.
CountingResult	Encapsulates the result of one iteration of a call of CountingAlgorithm.algorithm().
JerrumCountingAlgorithm	Implements the fully polynomial randomized approximation scheme, specified by Marc Jerrum, as a CountingAlgorithm.
JerrumHeatBathCountingAlgorithm	Implements a variant of the fully polynomial randomized approximation scheme, specified by Marc Jerrum, as a CountingAlgorithm.
NaiveCountingAlgorithm	Implements a Naive Counting Algorithm as a CountingAlgorithm.

Package edu.wwu.tobikley.acgc.algorithms Description

Provides algorithms for counting the proper q-Colorings of an undirected graph.