Uses of Class
com.TeamHEC.LocomotionCommotion.Goal.Graph.Node

Packages that use Node

com.TeamHEC.LocomotionCommotion.Goal.Graph

Uses of Node in com.TeamHEC.LocomotionCommotion.Goal.Graph

Fields in com.TeamHEC.LocomotionCommotion.Goal.Graph declared as Node

Node	Node.next next refers to the following node.
Node[]	Dijkstra.nodeList
Node	Edge.target

Methods in com.TeamHEC.LocomotionCommotion.Goal.Graph that return Node

Node	Dijkstra.lookUpNode(MapObj mapObj) a lookup table that returns a Node instance for a given map obj, it should be noted that nodes are just extended mapobj's.

Methods in com.TeamHEC.LocomotionCommotion.Goal.Graph that return types with arguments of type Node

java.util.List<Node>

Dijkstra.getShortestPathTo(Node target) getShortestPathTo is a function that takes in a target node and gets the shortest path to that node to another node, then returns the path in a list of nodes.

Methods in com.TeamHEC.LocomotionCommotion.Goal.Graph with parameters of type Node

int	Node.compareTo(Node other) Necessary to compare in the compute paths class
void	Dijkstra.computePaths(Node source) Compute paths takes a source node and updates the Tentative distance of all other nodes with the an integer value that represents the length between the source node and that particular nodes.
java.util.List<Node>	Dijkstra.getShortestPathTo(Node target) getShortestPathTo is a function that takes in a target node and gets the shortest path to that node to another node, then returns the path in a list of nodes.

Constructors in com.TeamHEC.LocomotionCommotion.Goal.Graph with parameters of type Node

Edge(Node tget, float weight)