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

Packages that use Edge

dk.deepthought.sidious.planner.graph

Provides classes and interfaces for representing graphs for the planner.

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

Classes in dk.deepthought.sidious.planner.graph that implement Edge

class

AStarEdge This class represent an edge in an A*-graph.

Fields in dk.deepthought.sidious.planner.graph declared as Edge

private Edge

AStarVertex.edgeToPredecessor The edge to the predecessor of this.

Methods in dk.deepthought.sidious.planner.graph that return types with arguments of type Edge

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.

Methods in dk.deepthought.sidious.planner.graph with parameters of type Edge

void	Vertex.update(Edge edgeToPredecessor, double cost) Updates this vertex' information about its predecessor and cost candidate.
void	AStarVertex.update(Edge edgeToPredecessor, double cost) This is the implementation of the update method.

Constructors in dk.deepthought.sidious.planner.graph with parameters of type Edge

AStarVertex(State state, double heuristic, Edge edgeToPredecessor, boolean source, boolean goal, double costCandidate)
Private utility constructor.