Struct SearchMap 

pub struct SearchMap {
    pub costs: Grid<Option<Cost>>,
    pub reached_from: Grid<Option<Point>>,
}

Map structure used for holding movement costs and parent nodes.

Fields

costs: Grid<Option<Cost>>

Cheapest known cost from each point to the goal set, or None when unreachable.

reached_from: Grid<Option<Point>>

The next point toward a goal for each reachable point.

Trait Implementations

impl Clone for SearchMap

fn clone(&self) -> SearchMap

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for SearchMap

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

Formats the value using the given formatter.

impl PartialEq for SearchMap

fn eq(&self, other: &SearchMap) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for SearchMap