Uses of Interface
dk.deepthought.sidious.planner.graph.Vertex

Packages that use Vertex
dk.deepthought.sidious.gui Provides classes for the gui and debug hooks into the planner 
dk.deepthought.sidious.planner.graph Provides classes and interfaces for representing graphs for the planner. 
 

Uses of Vertex in dk.deepthought.sidious.gui
 

Methods in dk.deepthought.sidious.gui with parameters of type Vertex
 void SidiousOutput.addVertex(Vertex vertex)
          Adds a vertex to this.
 void SidiousController.vertex(Vertex vertex)
          Sets the newly created vertex.
 

Uses of Vertex in dk.deepthought.sidious.planner.graph
 

Classes in dk.deepthought.sidious.planner.graph that implement Vertex
 class AStarVertex
          This class implements a vertex with respect to the A*-algorithm.
 

Fields in dk.deepthought.sidious.planner.graph declared as Vertex
private  Vertex AStarEdge.endVertex
          The end vertex.
private  Vertex AStarGraph.goalVertex
          The goal vertex of this.
private  Vertex AStarGraph.sourceVertex
          The source vertex of this.
private  Vertex AStarEdge.startVertex
          The start vertex.
 

Fields in dk.deepthought.sidious.planner.graph with type parameters of type Vertex
private  java.util.List<Vertex> AStarGraph.vertices
          The vertices of this.
 

Methods in dk.deepthought.sidious.planner.graph that return Vertex
 Vertex Edge.getEndVertex()
          Gets the endpoint of this Edge
 Vertex AStarEdge.getEndVertex()
           
 Vertex Graph.getGoalVertex()
          Gets the goal Vertex of this Graph.
 Vertex AStarGraph.getGoalVertex()
           
 Vertex Vertex.getPredecessorVertex()
          Gets the predecessor Vertex from the edge.
 Vertex AStarVertex.getPredecessorVertex()
           
 Vertex Graph.getSourceVertex()
          Gets the source Vertex of this Graph.
 Vertex AStarGraph.getSourceVertex()
           
 Vertex Edge.getStartVertex()
          Gets the startpoint of this Edge
 Vertex AStarEdge.getStartVertex()
           
(package private)  Vertex AStarGraph.getVertexFromState(State state)
          This method checks if the state is represented by a Vertex in the graph, and returns either the representing vertex or a new vertex, which is added to the graph.
 Vertex Vertex.toGoalVertex()
          Creates a goal vertex.
 Vertex AStarVertex.toGoalVertex()
           
 Vertex Vertex.toSourceVertex(Step initialStep)
          Creates a source vertex from the specified initial setpoints.
 Vertex AStarVertex.toSourceVertex(Step initialStep)
           
 

Methods in dk.deepthought.sidious.planner.graph with parameters of type Vertex
 java.util.Collection<Edge> Graph.getEdges(Vertex v)
          Gets the edges with the specified Vertex as starting point.
 java.util.Collection<Edge> AStarGraph.getEdges(Vertex v)
          This method retrieves the edges emanating from the Vertex v.
 boolean Vertex.partiallyEquals(Vertex vertex)
          Checks whether this vertex is contains all the state descriptors of the input vertex.
 boolean AStarVertex.partiallyEquals(Vertex otherVertex)
           
 void Graph.setApproximateGoal(Vertex v)
          Method sets the goalVertex to this vertex if all the goal state descriptors are contained in the input vertex.
 void AStarGraph.setApproximateGoal(Vertex v)
           
 

Constructors in dk.deepthought.sidious.planner.graph with parameters of type Vertex
AStarEdge(Vertex startVertex, Vertex endVertex, Step step, double cost)
           
 



Copyright © Deepthought Development - All Rights Reserved.