com.example.sulemaia.Model

Class PathManualTree.Node

java.lang.Object

com.example.sulemaia.Model.PathManualTree.Node

Enclosing class:

PathManualTree

public static class PathManualTree.Node
extends Object

Public class that contains all the attributes of the node that corresponds to a Manual Tree (Different from a Heuristic Tree Node).

Field Summary

Fields

Modifier and Type	Field and Description
private boolean	accessible
private ArrayList<PathManualTree.Node>	children
private float	cost
private PathManualTree.Node	father
private String	name
private StringBuilder	step

Constructor Summary

Constructors

Constructor and Description
Node(String name, float cost, boolean accessible) Constructor of the node.

Method Summary

Modifier and Type	Method and Description
private void	addChild(PathManualTree.Node child) Add a node as the child of a father node.
ArrayList<PathManualTree.Node>	getChildren() Return all of a node's children.
float	getCost() Get the cost of a node.
PathManualTree.Node	getFather() Get the father node of a certain node.
String	getName() Get the name of a node.
String	getStep() Get the actual step in which the algorithm is working right now.
boolean	isAccessible() Method to check if a certain tile (node) is accessible by the character.
void	setAccessible(boolean accessible) Set to a node the validation that it is accessible by the character.
void	setCost(float cost) Set a cost to a node.
void	setFather(PathManualTree.Node father) Set a node as a father of another certain node.
void	setName(String name) Set the name to a node.
void	setStep(int step) Set the atual step to a certain node.

Methods inherited from class java.lang.Object

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

Field Detail

children

private ArrayList<PathManualTree.Node> children

father

private PathManualTree.Node father

step

private StringBuilder step

name

private String name

cost

private float cost

accessible

private boolean accessible

Constructor Detail

Node

public Node(String name,
            float cost,
            boolean accessible)

Constructor of the node.

Parameters:

name - Name of the node.

cost - Cost of the node (from the tile configured by the user).

accessible - Whether the node is accessible or not by the character.

Method Detail

isAccessible

public boolean isAccessible()

Method to check if a certain tile (node) is accessible by the character. Deprecated.

Returns:

True or false variable.

setAccessible

public void setAccessible(boolean accessible)

Set to a node the validation that it is accessible by the character. Deprecated.

Parameters:

accessible - Full the attribute.

getChildren

public ArrayList<PathManualTree.Node> getChildren()

Return all of a node's children.

Returns:

An arraylist of children.

addChild

private void addChild(PathManualTree.Node child)

Add a node as the child of a father node.

Parameters:

child - The node to be advocated as child.

getFather

public PathManualTree.Node getFather()

Get the father node of a certain node.

Returns:

Father node of the actual node.

setFather

public void setFather(PathManualTree.Node father)

Set a node as a father of another certain node.

Parameters:

father - Father node.

getStep

public String getStep()

Get the actual step in which the algorithm is working right now.

Returns:

The value of the step.

setStep

public void setStep(int step)

Set the atual step to a certain node.

Parameters:

step - The value of the actual step.

getName

public String getName()

Get the name of a node.

Returns:

Name of the node.

setName

public void setName(String name)

Set the name to a node.

Parameters:

name - Name of the node.

getCost

public float getCost()

Get the cost of a node.

Returns:

The cost value.

setCost

public void setCost(float cost)

Set a cost to a node. Deprecated. because we put it in directly through the constructor, and dont use it anymore later, since the manual algorithm doesnt care about the weights of the nodes.

Parameters:

cost - Cost to be put into the node.