N - A - public class SubGraphGenerator<N,A> extends java.lang.Object implements GraphGenerator<N,A>
| Constructor and Description |
|---|
SubGraphGenerator(GraphGenerator<N,A> actualGraphGenerator,
N newRoot) |
| Modifier and Type | Method and Description |
|---|---|
GoalTester<N> |
getGoalTester() |
SingleRootGenerator<N> |
getRootGenerator() |
SuccessorGenerator<N,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
|
public SubGraphGenerator(GraphGenerator<N,A> actualGraphGenerator, N newRoot)
public SingleRootGenerator<N> getRootGenerator()
getRootGenerator in interface GraphGenerator<N,A>public SuccessorGenerator<N,A> getSuccessorGenerator()
getSuccessorGenerator in interface GraphGenerator<N,A>public GoalTester<N> getGoalTester()
getGoalTester in interface GraphGenerator<N,A>public boolean isSelfContained()
GraphGeneratorisSelfContained in interface GraphGenerator<N,A>true if every node contains every information needed for the solution,
false otherwise.public void setNodeNumbering(boolean nodenumbering)
GraphGeneratorsetNodeNumbering in interface GraphGenerator<N,A>