Uses of Interface
orbital.algorithm.template.AlgorithmicProblem

Packages that use AlgorithmicProblem

orbital.algorithm.evolutionary	Genetic algorithms simulate nature on a very abstract level to get solutions for sophisticated problems.
orbital.algorithm.template	A framework for general algorithmic evaluation schemes including search and planning algorithms.

Uses of AlgorithmicProblem in orbital.algorithm.evolutionary

Subinterfaces of AlgorithmicProblem in orbital.algorithm.evolutionary

interface

GeneticAlgorithmProblem Hook class for problems solved by GeneticAlgorithm.

Methods in orbital.algorithm.evolutionary that return AlgorithmicProblem

AlgorithmicProblem

GeneticAlgorithm.Configuration.getProblem() Get a modified view of the problem.

Methods in orbital.algorithm.evolutionary with parameters of type AlgorithmicProblem

java.lang.Object

GeneticAlgorithm.solve(AlgorithmicProblem gproblem) Solve a genetic algorithm problem.

Uses of AlgorithmicProblem in orbital.algorithm.template

Subinterfaces of AlgorithmicProblem in orbital.algorithm.template

interface	BacktrackingProblem Hook class for Backtracking Algorithms
interface	DivideAndConquerProblem Hook class for problems solved by DivideAndConquer.
interface	DynamicProgrammingProblem Hook class for problems solved by DynamicProgramming.
interface	GeneralSearchProblem Hook class for GeneralSearch algorithm.
interface	GreedyProblem Hook class for Greedy Algorithms.
interface	MarkovDecisionProblem Hook class for MarkovDecisionProcess algorithm.

Classes in orbital.algorithm.template that implement AlgorithmicProblem

class	DelegateGeneralSearchProblem Delegates to a GeneralSearchProblem.
class	DynamicProgrammingOptimizingProblem Base hook class for problems solved by DynamicProgramming for optimization.
class	OpenClosedGeneralSearchProblem GeneralSearchProblem wrapper keeping track of open and closed sets.

Methods in orbital.algorithm.template that return AlgorithmicProblem

AlgorithmicProblem	AlgorithmicTemplate.Configuration.getProblem()
AlgorithmicProblem	AlgorithmicConfiguration.getProblem() Gets the specific problem to solve.

Methods in orbital.algorithm.template with parameters of type AlgorithmicProblem

static AlgorithmicTemplate.Configuration	AlgorithmicTemplate.Configuration.flexible(AlgorithmicProblem problem, java.util.Map properties, java.lang.Class algorithm) Create a new flexible configuration.
java.lang.Object	MarkovDecisionProcess.solve(AlgorithmicProblem p) Solves an MDP problem.
java.lang.Object	Greedy.solve(AlgorithmicProblem gp) solves by greedy.
java.lang.Object	GeneralSearch.solve(AlgorithmicProblem gp) Solves a general search problem.
java.lang.Object	DynamicProgramming.solve(AlgorithmicProblem p)
java.lang.Object	DivideAndConquer.solve(AlgorithmicProblem p)
java.lang.Object	Backtracking.solve(AlgorithmicProblem p)
java.lang.Object	AlgorithmicTemplate.solve(AlgorithmicProblem p) Generic solve method for a given algorithmic problem.

Constructors in orbital.algorithm.template with parameters of type AlgorithmicProblem

AlgorithmicTemplate.Configuration(AlgorithmicProblem problem, java.lang.Class algorithm)
Create a new configuration.

AlgorithmicTemplate.Configuration(AlgorithmicProblem problem, java.lang.Class algorithm, java.lang.Class superClass)
Create a new configuration limited to certain classes of algorithms.

HeuristicAlgorithm.Configuration(AlgorithmicProblem problem, Function heuristic, java.lang.Class algorithm)