ai.libs.jaicore.search.model.travesaltree

Class ReducedGraphGenerator<T,A>

java.lang.Object

ai.libs.jaicore.search.model.travesaltree.ReducedGraphGenerator<T,A>

Type Parameters:

T -

A -

All Implemented Interfaces:

GraphGenerator<T,A>

public class ReducedGraphGenerator<T,A>
extends java.lang.Object
implements GraphGenerator<T,A>

Graph generator that uses another graph generator as a basis by reducing the graph generated by the basis generator so that it does not contain long chains of nodes anymore, that is successors of a node are skipped while a node only has 1 successor. Usage: Create a new ReducedGraphGenerator object and swap all ocurrences of the graph generator it uses as a basis with the reduced graph generator.

Constructor Summary

Constructors

Constructor and Description
ReducedGraphGenerator(GraphGenerator<T,A> basis) Create a new ReducedGraphGenerator that uses the given graph generator as a basis.

Method Summary

Modifier and Type	Method and Description
GoalTester<T>	getGoalTester()
RootGenerator<T>	getRootGenerator()
SuccessorGenerator<T,A>	getSuccessorGenerator()
boolean	isSelfContained() Indicates if the nodes are selfcontained for the solution or if the solution path is needed.
void	setNodeNumbering(boolean nodenumbering) Indicates whether the nodes should get a unique id, or if all should get the same id -1 This is important if one wants to guarantee that the explored graph is expanded as a tree

Methods inherited from class java.lang.Object

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

Constructor Detail

ReducedGraphGenerator

public ReducedGraphGenerator(GraphGenerator<T,A> basis)

Create a new ReducedGraphGenerator that uses the given graph generator as a basis.

Parameters:

basis - the graph generator to use as a basis

Method Detail

getRootGenerator

public RootGenerator<T> getRootGenerator()

Specified by:

getRootGenerator in interface GraphGenerator<T,A>

getSuccessorGenerator

public SuccessorGenerator<T,A> getSuccessorGenerator()

Specified by:

getSuccessorGenerator in interface GraphGenerator<T,A>

getGoalTester

public GoalTester<T> getGoalTester()

Specified by:

getGoalTester in interface GraphGenerator<T,A>

isSelfContained

public boolean isSelfContained()

Description copied from interface: GraphGenerator

Indicates if the nodes are selfcontained for the solution or if the solution path is needed.

Specified by:

isSelfContained in interface GraphGenerator<T,A>

Returns:

true if every node contains every information needed for the solution, false otherwise.

setNodeNumbering

public void setNodeNumbering(boolean nodenumbering)

Description copied from interface: GraphGenerator

Indicates whether the nodes should get a unique id, or if all should get the same id -1 This is important if one wants to guarantee that the explored graph is expanded as a tree

Specified by:

setNodeNumbering in interface GraphGenerator<T,A>