Struct ShortestPath 

pub struct ShortestPath { /* private fields */ }

Implementations

impl ShortestPath

pub fn new( source: NodeId, target: NodeId, weight: Weight, nodes: Vec<NodeId>, ) -> Self

pub fn singular(node: NodeId) -> Self

pub fn none(source: NodeId, target: NodeId) -> Self

pub fn get_source(&self) -> NodeId

pub fn get_target(&self) -> NodeId

pub fn get_weight(&self) -> Weight

pub fn get_nodes(&self) -> &Vec<NodeId>

pub fn is_found(&self) -> bool

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.

impl PartialEq for ShortestPath

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