anansi.algorithms.astar

Definitions for running an A* search over a graph

Members

AStarBfsVisitor struct AStarBfsVisitor(GraphT, QueueT, AStarVisitorT, DistanceMapT, PredecessorMapT, WeightMapT, CostMapT, ColourMapT, HeuristicT): Undocumented in source.
Visitor struct Visitor: Undocumented in source.

NullAstarVisitor template NullAstarVisitor(GraphT): Undocumented in source.
aStarSearch template aStarSearch(GraphT, VertexDescriptorT, HeuristicT, VisitorT = NullAstarVisitor!GraphT, WeightMapT = real[VertexDescriptorT], PredecessorMapT = VertexDescriptorT[VertexDescriptorT], DistanceMapT = real[VertexDescriptorT]): Undocumented in source.
aStarSearch template aStarSearch(GraphT, VertexDescriptorT, HeuristicT, VisitorT = NullAstarVisitor!GraphT, ColourMapT = Colour[VertexDescriptorT], PredecessorMapT = VertexDescriptorT[VertexDescriptorT], WeightMapT = real[VertexDescriptorT], DistanceMapT = real[VertexDescriptorT], CostMapT = real[VertexDescriptorT]): Undocumented in source.
aStarSearchNoInit template aStarSearchNoInit(GraphT, VertexDescriptorT, HeuristicT, VisitorT = NullAstarVisitor!GraphT, ColourMapT = Colour[VertexDescriptorT], PredecessorMapT = VertexDescriptorT[VertexDescriptorT], WeightMapT = real[VertexDescriptorT], DistanceMapT = real[VertexDescriptorT], CostMapT = real[VertexDescriptorT]): Undocumented in source.
extractPath template extractPath(VertexDescriptorT, PredecessorMapT = VertexDescriptorT[VertexDescriptorT]): Undocumented in source.
isAStarHeuristic template isAStarHeuristic(CallableT, VertexT): Undocumented in source.