Module pathfinding::directed::astar
source · Expand description
Compute a shortest path (or all shorted paths) using the A* search algorithm.
Structs§
- Iterator structure created by the
astar_bag
function.
Functions§
- Compute a shortest path using the A* search algorithm.
- Compute all shortest paths using the A* search algorithm. Whereas
astar
(non-deterministic-ally) returns a single shortest path,astar_bag
returns all shortest paths (in a non-deterministic order). - Compute all shortest paths using the A* search algorithm. Whereas
astar
(non-deterministic-ally) returns a single shortest path,astar_bag
returns all shortest paths (in a non-deterministic order).