Package cusack.hcg.graph.algorithm

Contains classes that allow algorithms to be run on graphs and problems.

See: Description

Interface Summary

Interface	Description
AlgorithmInterface<T extends PuzzleInstance>	An interface for algorithms

Class Summary

Class	Description
AbstractAlgorithm<T extends PuzzleInstance>	An abstract implementation of AlgorithmInterface with of the more peripheral/annoying methods filled in.
AlgorithmWrapper	A generic class that all algorithms will inherit from.
CountShortestPathsAlgorithm
OldGenericAlgorithm<T extends PuzzleInstance>	Deprecated

Enum Summary

Enum	Description
AlgorithmStates

Package cusack.hcg.graph.algorithm Description

Contains classes that allow algorithms to be run on graphs and problems. The heart of this package is AlgorithmInterface, which allows algorithms to be standardized and run on graphs within the Algoraph user interface. Because AlgorithmInterface requires some seemingly-extraneous methods to be implemented, an AbstractAlgorithm class is available to simplify the creation of new algorithms. In AbstractAlgorithm, many of these methods are filled in with default values that will work well for many/most algorithms.