planner.graphPlan

Class GraphNode

java.lang.Object

planner.graphPlan.GraphNode

Direct Known Subclasses:

ActionNode, LiteralNode

public abstract class GraphNode
extends Object

Abstract class for a node in the graphPlan graph

Author:

dtdavis

Constructor Summary

Constructors

Constructor and Description
GraphNode(GraphNodeObject node) Creates a new instance of GraphNode

Method Summary

Modifier and Type	Method and Description
protected void	addBackPointer(GraphNode node) Adds a back pointer to a node in the previous graph layer
protected void	addForwardPointer(GraphNode node) Adds a forward pointer to a node in the next graph layer
static void	connect(ActionNode action, LiteralNode literal) Adds forward and backward pointers to the nodes to connect them in the graph
static void	connect(LiteralNode literal, ActionNode action) Adds forward and backward pointers to the nodes to connect them in the graph
static void	connect(LiteralNode literal1, LiteralNode literal2) Adds forward and backward pointers to literals that are carried forward in the graph through maintenance actions (still potentially true at subsequent literal layers even if they are not explicit postconditions of any action layer actions
static boolean	contains(List<ActionNode> list, GraphNode node) Returns true if an array list contains a node that is equivalent to the parameter
boolean	containsBackPointer(GraphNode node) Determines whether or not a graph node contains a backpointer to another node
boolean	containsForwardPointer(GraphNode node) Determines whether or not a graph node contains a backpointer to another node
GraphNode	getBackPointer(int index) Returns a secified back pointer node
GraphNode	getForwardPointer(int index) Returns a secified forward pointer node
static boolean	isMutex(GraphNode node1, GraphNode node2) Determines whether two GraphNodes are mutually exclusive
boolean	match(GraphNode gNode) Returns true if a GraphNode parameter is equivalent to this one
static boolean	mutexIsSet(GraphNode node1, GraphNode node2) Returns true if two nodes are contained in each other's mutually exclusive lists
int	numBackPointers() Returns the number of forward pointers
int	numForwardPointers() Returns the number of forward pointers
static void	setMutex(GraphNode node1, GraphNode node2) Adds 2 graph nodes to each other's mutually exclusive lists
String	toString() Converts the GraphNode to a String

Methods inherited from class java.lang.Object

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

Constructor Detail

GraphNode

public GraphNode(GraphNodeObject node)

Creates a new instance of GraphNode

Parameters:

node -

Method Detail

addForwardPointer

protected void addForwardPointer(GraphNode node)

Adds a forward pointer to a node in the next graph layer

Parameters:

node - the next layer graph to which the pointer refers

addBackPointer

protected void addBackPointer(GraphNode node)

Adds a back pointer to a node in the previous graph layer

Parameters:

node - the previous layer graph to which the pointer refers

numForwardPointers

public int numForwardPointers()

Returns the number of forward pointers

Returns:

numBackPointers

public int numBackPointers()

Returns the number of forward pointers

Returns:

getForwardPointer

public GraphNode getForwardPointer(int index)

Returns a secified forward pointer node

Parameters:

index - number of the link

Returns:

getBackPointer

public GraphNode getBackPointer(int index)

Returns a secified back pointer node

Parameters:

index - number of the link

Returns:

containsForwardPointer

public boolean containsForwardPointer(GraphNode node)
                               throws NullPointerException,
                                      ClassCastException

Determines whether or not a graph node contains a backpointer to another node

Parameters:

node - node being chec number of the link

Returns:

Throws:

NullPointerException

ClassCastException

containsBackPointer

public boolean containsBackPointer(GraphNode node)
                            throws NullPointerException,
                                   ClassCastException

Determines whether or not a graph node contains a backpointer to another node

Parameters:

node - node being chec number of the link

Returns:

Throws:

NullPointerException

ClassCastException

connect

public static void connect(LiteralNode literal,
                           ActionNode action)

Adds forward and backward pointers to the nodes to connect them in the graph

Parameters:

literal - literal node that is to be connected as a precondition of an action

action - action node that is being assigned a precondition

connect

public static void connect(ActionNode action,
                           LiteralNode literal)

Adds forward and backward pointers to the nodes to connect them in the graph

Parameters:

action - action node that is being assigned a postcondition

literal - literal node that is to be connected as a postcondition of an action

connect

public static void connect(LiteralNode literal1,
                           LiteralNode literal2)

Adds forward and backward pointers to literals that are carried forward in the graph through maintenance actions (still potentially true at subsequent literal layers even if they are not explicit postconditions of any action layer actions

Parameters:

literal1 - literal node that needs to be carried forward from layer n

literal2 - literal node that needs to be included in layer n+2

contains

public static boolean contains(List<ActionNode> list,
                               GraphNode node)

Returns true if an array list contains a node that is equivalent to the parameter

Parameters:

list -

node -

Returns:

match

public boolean match(GraphNode gNode)

Returns true if a GraphNode parameter is equivalent to this one

Parameters:

gNode -

Returns:

isMutex

public static boolean isMutex(GraphNode node1,
                              GraphNode node2)

Determines whether two GraphNodes are mutually exclusive

Parameters:

node1 -

node2 -

Returns:

setMutex

public static void setMutex(GraphNode node1,
                            GraphNode node2)

Adds 2 graph nodes to each other's mutually exclusive lists

Parameters:

node1 -

node2 -

mutexIsSet

public static boolean mutexIsSet(GraphNode node1,
                                 GraphNode node2)

Returns true if two nodes are contained in each other's mutually exclusive lists

Parameters:

node1 -

node2 -

Returns:

toString

public String toString()

Converts the GraphNode to a String

Overrides:

toString in class Object