ai.libs.jaicore.search.core.interfaces

Interface GraphGenerator<T,A>

All Known Subinterfaces:

PathUnifyingGraphGenerator<N,A>, SerializableGraphGenerator<T,A>, VersionedGraphGeneratorInterface<T,A>

All Known Implementing Classes:

AbstractGraphGenerator, ReducedGraphGenerator, SubGraphGenerator, SubPathGraphGenerator, VersionedGraphGenerator

public interface GraphGenerator<T,A>

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

Method Detail

getRootGenerator

RootGenerator<T> getRootGenerator()

getSuccessorGenerator

SuccessorGenerator<T,A> getSuccessorGenerator()

getGoalTester

GoalTester<T> getGoalTester()

isSelfContained

boolean isSelfContained()

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

Returns:

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

setNodeNumbering

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