Struct ShortestPathOp 

pub struct ShortestPathOp {
    pub input: Box<LogicalOperator>,
    pub source_var: String,
    pub target_var: String,
    pub edge_types: Vec<String>,
    pub direction: ExpandDirection,
    pub path_alias: String,
    pub all_paths: bool,
}

Find shortest path between two nodes.

This operator uses Dijkstra’s algorithm to find the shortest path(s) between a source node and a target node, optionally filtered by edge type.

Fields

input: Box<LogicalOperator>

Input operator providing source/target nodes.

source_var: String

Variable name for the source node.

target_var: String

Variable name for the target node.

edge_types: Vec<String>

Edge type filter (empty = match all types, multiple = match any).

direction: ExpandDirection

Direction of edge traversal.

path_alias: String

Variable name to bind the path result.

all_paths: bool

Whether to find all shortest paths (vs. just one).

Trait Implementations

impl Clone for ShortestPathOp

fn clone(&self) -> ShortestPathOp

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ShortestPathOp

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

Formats the value using the given formatter.