Package org.arakhne.afc.math.graph.astar
-
Interface Summary Interface Description AStarCostComputer<ST extends GraphSegment<ST,PT>,PT extends GraphPoint<PT,ST>> This interface provides a way to theA* algorithm
to compute the costs of the graph points and the segments.AStarHeuristic<PT extends GraphPoint<PT,?>> This interface provides an heuristic evaluation of a path for theA* algorithm
.AStarListener<ST extends GraphSegment<ST,PT>,PT extends GraphPoint<PT,ST>> This interface is implemented by the listeners on the progression of theA* algorithm
.AStarNode<ST extends GraphSegment<ST,PT>,PT extends GraphPoint<PT,ST>> This interface provides services for an A* node.AStarPathFactory<GP extends GraphPath<GP,ST,PT>,ST extends GraphSegment<ST,PT>,PT extends GraphPoint<PT,ST>> This interface provides a mean to create a path factory for theA* algorithm
.AStarSegmentOrientation<ST extends GraphSegment<ST,PT>,PT extends GraphPoint<PT,ST>> This interface provides a way to theA* algorithm
to retreive the orientation of a segment.AStarSegmentReplacer<ST extends GraphSegment<ST,?>> This interface provides a way to replace the segments of the paths found by theA* algorithm
. -
Class Summary Class Description AStar<GP extends GraphPath<GP,ST,PT>,ST extends GraphSegment<ST,PT>,PT extends GraphPoint<PT,ST>> This class provides an implementation of the famous A* algorithm.AStar.CloseComparator<ST extends GraphSegment<ST,PT>,PT extends GraphPoint<PT,ST>> Comparator used to sort the close list of A* algorithm.AStar.OpenComparator<ST extends GraphSegment<ST,PT>,PT extends GraphPoint<PT,ST>> Comparator used to sort the open list of A* algorithm.