Struct KnowledgePath 

pub struct KnowledgePath {
    pub nodes: Vec<String>,
    pub predicates: Vec<String>,
    pub hop_count: usize,
    pub score: f64,
}

A path through the knowledge graph represented as an ordered list of nodes and the edges traversed.

Fields

nodes: Vec<String>

Ordered node sequence (subject → … → object).

predicates: Vec<String>

Predicates traversed at each step (length = nodes.len() - 1).

hop_count: usize

Number of hops.

score: f64

Aggregate path score (sum of edge weights).

Implementations

impl KnowledgePath

pub fn narrative(&self) -> String

Build a human-readable narrative of the path.

Example: "Alice —[knows]→ Bob —[works_at]→ ACME"

Trait Implementations

impl Clone for KnowledgePath

fn clone(&self) -> KnowledgePath

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for KnowledgePath

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

Formats the value using the given formatter.

impl PartialEq for KnowledgePath

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