ai.libs.jaicore.search.model.travesaltree

Class VersionedGraphGenerator<T,A>

java.lang.Object

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

All Implemented Interfaces:

GraphGenerator<VersionedDomainNode<T>,A>, VersionedGraphGeneratorInterface<VersionedDomainNode<T>,A>

public class VersionedGraphGenerator<T,A>
extends java.lang.Object
implements VersionedGraphGeneratorInterface<VersionedDomainNode<T>,A>

Class which wraps up a normal GraphGenerator and is adding a id to every node

Constructor Summary

Constructors

Constructor and Description
VersionedGraphGenerator(GraphGenerator<T,A> gen)

Method Summary

Modifier and Type	Method and Description
NodeGoalTester<VersionedDomainNode<T>>	getGoalTester()
MultipleRootGenerator<VersionedDomainNode<T>>	getMultipleRootGenerator()
int	getNextID() Retrieves the next id
NodeGoalTester<VersionedDomainNode<T>>	getNodeGoalTester() A method which redirects the NodeGoalTester from VersionedT to T
PathGoalTester<VersionedDomainNode<T>>	getPathGoalTester() Method which redirects the pathgoaltester from versioned nodes to simple t nodes.
SingleRootGenerator<VersionedDomainNode<T>>	getRootGenerator()
SingleRootGenerator<VersionedDomainNode<T>>	getSingleRootGenerator()
SuccessorGenerator<VersionedDomainNode<T>,A>	getSuccessorGenerator()
boolean	isSelfContained() Indicates if the nodes are selfcontained for the solution or if the solution path is needed.
void	setNodeNumbering(boolean numbering) 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

VersionedGraphGenerator

public VersionedGraphGenerator(GraphGenerator<T,A> gen)

Method Detail

getNextID

public int getNextID()

Retrieves the next id

Returns:

returns a unique id if numbering is enable, otherwise -1

getRootGenerator

public SingleRootGenerator<VersionedDomainNode<T>> getRootGenerator()

Specified by:

getRootGenerator in interface GraphGenerator<VersionedDomainNode<T>,A>

getSingleRootGenerator

public SingleRootGenerator<VersionedDomainNode<T>> getSingleRootGenerator()

getMultipleRootGenerator

public MultipleRootGenerator<VersionedDomainNode<T>> getMultipleRootGenerator()

getSuccessorGenerator

public SuccessorGenerator<VersionedDomainNode<T>,A> getSuccessorGenerator()

Specified by:

getSuccessorGenerator in interface GraphGenerator<VersionedDomainNode<T>,A>

getGoalTester

public NodeGoalTester<VersionedDomainNode<T>> getGoalTester()

Specified by:

getGoalTester in interface GraphGenerator<VersionedDomainNode<T>,A>

getNodeGoalTester

public NodeGoalTester<VersionedDomainNode<T>> getNodeGoalTester()

A method which redirects the NodeGoalTester from VersionedT to T

Returns:

getPathGoalTester

public PathGoalTester<VersionedDomainNode<T>> getPathGoalTester()

Method which redirects the pathgoaltester from versioned nodes to simple t nodes. This method does currently not work as it is not implemented to extract the path from a versioned node

Returns:

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<VersionedDomainNode<T>,A>

Returns:

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

setNodeNumbering

public void setNodeNumbering(boolean numbering)

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<VersionedDomainNode<T>,A>

Specified by:

setNodeNumbering in interface VersionedGraphGeneratorInterface<VersionedDomainNode<T>,A>