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

Packages that use Graph

dk.deepthought.sidious.planner	Provides classes and interfaces for the planning and pathfinding algorithms
dk.deepthought.sidious.planner.graph	Provides classes and interfaces for representing graphs for the planner.

Uses of Graph in dk.deepthought.sidious.planner

Fields in dk.deepthought.sidious.planner with type parameters of type Graph

private SidiousQueue<Graph>	PlannerEngine.pathfinderQueue Queue to facilitate the path finding.
private SidiousQueue<Graph>	PlannerEngine.planGeneratorQueue Queue to handle the generation of a plan from a searched graph.

Methods in dk.deepthought.sidious.planner that return Graph

static Graph

GraphFactory.makeGraph(SuperLinkID requester, State source, State goal) This method is a factory for creating a Graph.

Methods in dk.deepthought.sidious.planner with parameters of type Graph

static Plan	PlanGenerator.generatePlan(Graph graph) This method traverses the Graph and generates a Plan from that result.
private void	AStarAlgorithm.jAStar(Graph graph) This method implements the A* algorithm.
void	Pathfinder.search(Graph graph) This is the search algorithm.
void	AStarAlgorithm.search(Graph graph)

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

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

class

AStarGraph Represents a graph for use with the A-Star algorithm.