public interface GraphGenerator<T,A>
| 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
|
RootGenerator<T> getRootGenerator()
SuccessorGenerator<T,A> getSuccessorGenerator()
GoalTester<T> getGoalTester()
boolean isSelfContained()
true if every node contains every information needed for the solution,
false otherwise.void setNodeNumbering(boolean nodenumbering)