Struct Dijkstra 

pub struct Dijkstra;

Weighted-grid Pathfinder: uniform-priority Dijkstra.

Cost model: sums per-cell traversal_cost on 4-connected edges; no heuristic. Prefer as the exact weighted baseline against A*/JPS; A* is usually faster with admissible heuristics on the same model.

Trait Implementations

impl Clone for Dijkstra

fn clone(&self) -> Dijkstra

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for Dijkstra

impl Debug for Dijkstra

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

Formats the value using the given formatter.

impl Default for Dijkstra

fn default() -> Dijkstra

Returns the “default value” for a type.

impl Pathfinder for Dijkstra

fn name(&self) -> &'static str

Stable algorithm identifier for benchmarks, logs, and solver portfolios.

fn search(&self, grid: &Grid, request: SearchRequest) -> SearchResult

Runs one search on grid for request.