Enum ShortestPathMethod 

pub enum ShortestPathMethod {
    Dijkstra,
    BellmanFord,
    FloydWarshall,
    Auto,
}

Shortest path algorithm types

Variants

Dijkstra

Dijkstra’s algorithm (non-negative weights only)

BellmanFord

Bellman-Ford algorithm (handles negative weights)

FloydWarshall

Floyd-Warshall algorithm (all pairs shortest paths)

Auto

Automatic selection based on graph properties

Implementations

impl ShortestPathMethod

pub fn from_str(s: &str) -> SparseResult<Self>

Trait Implementations

impl Clone for ShortestPathMethod

fn clone(&self) -> ShortestPathMethod

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ShortestPathMethod

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

Formats the value using the given formatter.

impl PartialEq for ShortestPathMethod

fn eq(&self, other: &ShortestPathMethod) -> 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 ShortestPathMethod

impl StructuralPartialEq for ShortestPathMethod