Struct GraphPath 

pub struct GraphPath<'a> {
    pub nodes: Vec<GraphId<'a>>,
    pub edges: Vec<GraphId<'a>>,
    pub state: StateRow,
    pub intermediate_states: Option<Vec<StateRow>>,
}

One materialized path returned by a traversal.

IDs are borrowed from the graph. For integer-ID graphs the variants are GraphId::U64; for string-ID graphs they are GraphId::Str.

Fields

nodes: Vec<GraphId<'a>>

External node IDs in path order, including the start and final node.

edges: Vec<GraphId<'a>>

Edge IDs in path order.

state: StateRow

Final named state after the last accepted edge.

For a zero-edge path this is the kernel’s initial state.

intermediate_states: Option<Vec<StateRow>>

Optional per-node state history in path order.

Present only when TraversalConfigBuilder::with_intermediate_states is enabled. The first entry is the initial state at the start node; the final entry equals GraphPath::state.

Trait Implementations

impl<'a> Clone for GraphPath<'a>

fn clone(&self) -> GraphPath<'a>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<'a> Debug for GraphPath<'a>

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

Formats the value using the given formatter.

impl<'a> PartialEq for GraphPath<'a>

fn eq(&self, other: &GraphPath<'a>) -> 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<'a> StructuralPartialEq for GraphPath<'a>