Struct hierarchical_pathfinding::neighbors::MooreNeighborhood

pub struct MooreNeighborhood { /* fields omitted */ }

A Neighborhood for Agents moving along the 4 cardinal directions and the 4 diagonals.

Also known as Moore Neighborhood, Maximum Metric or Chebyshev Metric.

A: Agent, o: reachable in one step
o o o
 \|/
o-A-o
 /|\
o o o

Methods

impl MooreNeighborhood

pub fn new(width: usize, height: usize) -> MooreNeighborhood

Creates a new MooreNeighborhood.

width and height are the size of the Grid to move on.

Trait Implementations

impl Neighborhood for MooreNeighborhood

fn get_all_neighbors(&self, point: Point) -> Box<dyn Iterator<Item = Point>>

Provides a list of Neighbors of a Point

fn heuristic(&self, point: Point, goal: Point) -> usize

Gives a Heuristic for how long it takes to reach goal from point.

impl Clone for MooreNeighborhood

fn clone(&self) -> MooreNeighborhood

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Copy for MooreNeighborhood

impl Debug for MooreNeighborhood

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

Formats the value using the given formatter.