Struct PhysicalRecursiveExtend 

pub struct PhysicalRecursiveExtend {
    pub source_table_id: u64,
    pub rel_table_ids: Vec<u64>,
    pub lower_bound: u64,
    pub upper_bound: u64,
    pub direction: ExtendDirection,
    pub semantic: PathSemantic,
    pub table_catalog: Option<Arc<TableCatalog>>,
    pub weight_property: Option<String>,
    pub cost_output_name: Option<String>,
}

Physical operator for variable-length path matching (BFS traversal).

For each source node, performs BFS up to upper_bound depth and emits result rows for all nodes reachable at depths between lower_bound and upper_bound.

Uses GDS-style path tracking to record actual paths (node IDs + edge IDs) and enforces path semantics (WALK/TRAIL/ACYCLIC).

Produces a DataChunk with columns: (src_offset, dst_offset, length, path_node_ids, path_edge_ids[, cost])

When weight_property is Some, uses Dijkstra’s algorithm for weighted shortest path traversal (port of C++ WeightedSPPathsFunction). The cost column is appended to the output.

Fields

source_table_id: u64

rel_table_ids: Vec<u64>

lower_bound: u64

upper_bound: u64

direction: ExtendDirection

semantic: PathSemantic

table_catalog: Option<Arc<TableCatalog>>

weight_property: Option<String>

Optional edge weight property name for weighted shortest path. When set, Dijkstra traversal is used instead of BFS.

cost_output_name: Option<String>

Optional name for the cost output column.

Trait Implementations

impl PhysicalOperatorExec for PhysicalRecursiveExtend

fn operator_type(&self) -> &str

fn execute(&self, input: Vec<DataChunk>) -> OperatorResult