Struct Path 

pub struct Path {
    pub schema: &'static str,
    pub from: String,
    pub to: String,
    pub found: bool,
    pub length: usize,
    pub hops: Vec<PathHop>,
}

A shortest path between two nodes. Edges are followed in either direction (the graph is treated as undirected for reachability), and each hop records the actual direction and provenance of the edge used.

Fields

schema: &'static str

Stable schema tag (SCHEMA).

from: String

Natural key of the start node.

to: String

Natural key of the goal node.

found: bool

Whether a path (including the trivial empty one) was found.

length: usize

Number of hops (edges) in the path; 0 when from == to.

hops: Vec<PathHop>

The hops from from to to, in order.

Trait Implementations

impl Clone for Path

fn clone(&self) -> Path

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Path

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

Formats the value using the given formatter.

impl PartialEq for Path

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

Equality operator ==.

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

Inequality operator !=.

impl Serialize for Path

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for Path