Struct DijkstraMap 

pub struct DijkstraMap {
    pub width: usize,
    pub height: usize,
    pub distances: Vec<f32>,
    pub flow: Vec<Option<(usize, usize)>>,
}

A distance field computed simultaneously from multiple source cells. Useful for “all enemies chase the player” scenarios — compute once, use many.

Fields

width: usize

height: usize

distances: Vec<f32>

flow: Vec<Option<(usize, usize)>>

Implementations

impl DijkstraMap

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

Create an empty map of the same dimensions as grid.

pub fn build(&mut self, grid: &PathGrid, goals: &[Vec2])

Build the distance field from a set of goal positions (world coords).

pub fn build_from_cells(&mut self, grid: &PathGrid, goals: &[(usize, usize)])

Build from grid coordinates directly.

pub fn distance_at(&self, grid: &PathGrid, pos: Vec2) -> f32

Get the distance at a world position.

pub fn next_step(&self, grid: &PathGrid, pos: Vec2) -> Option<Vec2>

Get the best next step from a world position toward the nearest goal.

pub fn extract_path(&self, grid: &PathGrid, start: Vec2) -> Vec<Vec2>

Extract a full path by following the flow field from start to any goal.

Trait Implementations

impl Clone for DijkstraMap

fn clone(&self) -> DijkstraMap

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for DijkstraMap

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

Formats the value using the given formatter.