Struct controlled_astar::astar::AStar

pub struct AStar { /* private fields */ }

Structure implementing the A* algorithm.

Implementations

impl AStar

pub fn new(nodes: HashMap<(usize, usize), Node>) -> Self

Creates a new AStar instance with the provided nodes.

Parameters

• nodes: A map of nodes where the keys are positions (x, y) and the values are Node objects.

Returns

A new AStar instance initialized with the provided nodes.

Example

let nodes = HashMap::new();
let astar = AStar::new(nodes);

pub fn find_shortest_path( &mut self, start: (usize, usize), goal: (usize, usize) ) -> Result<Option<Vec<(usize, usize)>>, AStarError>

Finds the shortest path from start to goal using the A* algorithm.

Parameters

• start: The starting point as a tuple (x, y).
• goal: The goal point as a tuple (x, y).

Returns

A Result<Option<Vec<(usize, usize)>>, AStarError> containing the path from the start to the goal if found, or an AStarError if no path is found or if an error occurs.

Example

let mut astar = AStar::new(nodes);
let path = astar.find_shortest_path((0, 0), (5, 5));

Trait Implementations

impl Debug for AStar

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.