teetime.framework.divideandconquer

Class AbstractDivideAndConquerProblem<P,S>

java.lang.Object

teetime.framework.divideandconquer.Identifiable

teetime.framework.divideandconquer.AbstractDivideAndConquerProblem<P,S>

Type Parameters:

P - The type of the problem.

S - The type of the problems solution.

Direct Known Subclasses:

QuicksortProblem

public abstract class AbstractDivideAndConquerProblem<P,S>
extends Identifiable

Generic template for divide and conquer problems.

Author:

Robin Mohr

Constructor Summary

Constructors

Modifier	Constructor and Description
protected	AbstractDivideAndConquerProblem()
protected	AbstractDivideAndConquerProblem(int id)

Method Summary

Modifier and Type	Method and Description
abstract S	baseSolve() Solves the problem, only if it is a base case problem.
abstract DividedDCProblem<P>	divide() Divides the problem and creates a DividedDCProblem.
abstract boolean	isBaseCase() Determines whether or not the problem is a base case.

Methods inherited from class teetime.framework.divideandconquer.Identifiable

getID

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

AbstractDivideAndConquerProblem

protected AbstractDivideAndConquerProblem()

AbstractDivideAndConquerProblem

protected AbstractDivideAndConquerProblem(int id)

Method Detail

isBaseCase

public abstract boolean isBaseCase()

Determines whether or not the problem is a base case.

Returns:

The boolean whose properties determine the split condition

divide

public abstract DividedDCProblem<P> divide()

Divides the problem and creates a DividedDCProblem.

Returns:

DividedDCProblem

baseSolve

public abstract S baseSolve()

Solves the problem, only if it is a base case problem.

Returns:

AbstractDivideAndConquerSolution