Struct ShortestPath 

pub struct ShortestPath {
    pub nodes: Vec<NodeId>,
    pub edges: Vec<EdgeId>,
    pub cost: f64,
    pub found: bool,
    pub nodes_visited: usize,
}

Result of a shortest path computation

Fields

nodes: Vec<NodeId>

Sequence of nodes in the path

edges: Vec<EdgeId>

Sequence of edges in the path

cost: f64

Total cost of the path

found: bool

Whether a path was found

nodes_visited: usize

Number of nodes visited during search

Implementations

impl ShortestPath

pub fn not_found() -> Self

Create a new empty path (not found)

pub fn new(nodes: Vec<NodeId>, edges: Vec<EdgeId>, cost: f64) -> Self

Create a path from node and edge sequences

pub fn with_visited(self, count: usize) -> Self

Set the number of nodes visited

Trait Implementations

impl Clone for ShortestPath

fn clone(&self) -> ShortestPath

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ShortestPath

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

Formats the value using the given formatter.