Enum PathFindingAlgorithm 

pub enum PathFindingAlgorithm {
    Dijkstra,
    AStar,
    Bidirectional,
    DijkstraTurnRestricted,
    AStarTurnRestricted,
    TimeDependentDijkstra,
}

Algorithm to use for pathfinding

Variants

Dijkstra

Dijkstra’s algorithm (guarantees shortest path)

AStar

A* algorithm (heuristic-guided, faster but needs good heuristic)

Bidirectional

Bidirectional search (searches from both ends)

DijkstraTurnRestricted

Dijkstra with turn restrictions (edge-based expansion)

AStarTurnRestricted

A* with turn restrictions

TimeDependentDijkstra

Time-dependent Dijkstra

Trait Implementations

impl Clone for PathFindingAlgorithm

fn clone(&self) -> PathFindingAlgorithm

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for PathFindingAlgorithm

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

Formats the value using the given formatter.

impl PartialEq for PathFindingAlgorithm

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Copy for PathFindingAlgorithm

impl Eq for PathFindingAlgorithm

impl StructuralPartialEq for PathFindingAlgorithm