Struct GraphHop 

#[non_exhaustive]
pub struct GraphHop<E> {
    pub edge_id: EdgeId,
    pub from: NodeId,
    pub to: NodeId,
    pub edge: E,
    pub timestamp: DateTime<Utc>,
}

One traversal hop produced by GraphMemory::traverse or GraphMemory::find_path.

Fields (Non-exhaustive)

Non-exhaustive structs could have additional fields added in future. Therefore, non-exhaustive structs cannot be constructed in external crates using the traditional Struct { .. } syntax; cannot be matched against without a wildcard ..; and struct update syntax will not work.

edge_id: EdgeId

Edge that connects the previous node to node.

from: NodeId

Source of the edge (the previously-visited node).

to: NodeId

Destination of the edge — the freshly-reached node.

edge: E

Edge payload.

timestamp: DateTime<Utc>

Wall-clock timestamp recorded when the edge was inserted. Carried on the hop so callers don’t have to issue a second backend lookup just to access temporal data.

Implementations

impl<E> GraphHop<E>

pub const fn new( edge_id: EdgeId, from: NodeId, to: NodeId, edge: E, timestamp: DateTime<Utc>, ) -> Self

Construct a hop from the five fields every backend supplies. Backends use this constructor (rather than struct-literal syntax) so the #[non_exhaustive] evolvability guarantee holds across the workspace boundary.

Trait Implementations

impl<E: Clone> Clone for GraphHop<E>

fn clone(&self) -> GraphHop<E>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<E: Debug> Debug for GraphHop<E>

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

Formats the value using the given formatter.