Struct ExpandNode 

pub struct ExpandNode {
    pub input: Arc<LogicalPlan>,
    pub rel_type_name: String,
    pub src_var: u32,
    pub dst_var: u32,
    pub edge_var: u32,
    pub direction: Direction,
    pub rel_ty: Option<u32>,
    pub dir: PathBuf,
    pub mode: OntologyMode,
    pub edge_prop_count: usize,
    /* private fields */
}

Physical node for adjacency-backed single-hop expansion (#763).

Emitted by the lowerer instead of the two-join chain whenever a project read target is available. The physical ExpandExec (graphforge-exec) probes the session adjacency provider per frontier row; that provider owns the hit/miss/building fallback policy, so plan shape is stable across index state and downstream LIMIT can cancel traversal work (#1248).

Output schema (join-path parity)

Exactly what the join chain would have produced, in the same order: the input’s qualified fields, then the edge topology fields (typed or exploratory/wildcard) qualified var_<edge_var>, then persisted edge-property fields (forced nullable — the join path LEFT-joins them) also under var_<edge_var>, then the destination node’s topology fields qualified var_<dst_var>. Destination type filtering and property joining stay downstream in the binder’s trailing NodeScan{dst, ty} (#789), exactly as on the join path.

For Undirected, ExpandExec collapses the provider’s duplicate self-loop entries per input row, matching the relational union shape.

Fields

input: Arc<LogicalPlan>

Input plan (the source node scan / prior pipeline).

rel_type_name: String

Name of the relation type to expand along ("*" for wildcard).

src_var: u32

Source node pattern-variable id (the frontier seed in the input).

dst_var: u32

Destination node pattern-variable id (bound to the reached node).

edge_var: u32

Edge pattern-variable id (bound per-column, like the join path).

direction: Direction

Edge traversal direction.

rel_ty: Option<u32>

Resolved relation type id (TypeId.0), absent for wildcard expansion.

dir: PathBuf

Project directory the physical node reads from.

mode: OntologyMode

Ontology mode controlling the persisted edge layout.

edge_prop_count: usize

How many of the var_<edge_var> fields are edge-property columns (the trailing ones); the rest are edge topology columns.

Implementations

impl ExpandNode

pub fn new( input: Arc<LogicalPlan>, rel_type_name: impl Into<String>, src_var: u32, dst_var: u32, edge_var: u32, direction: Direction, rel_ty: Option<u32>, dir: PathBuf, mode: OntologyMode, edge_fields: Vec<Arc<Field>>, edge_prop_fields: Vec<Arc<Field>>, dst_fields: Vec<Arc<Field>>, ) -> Self

Create an adjacency-backed single-hop expand node.

edge_fields are the typed edge table’s topology columns and edge_prop_fields the relation’s persisted property columns (the lowerer discovers them from edge_properties/<REL>.parquet and forces them nullable); dst_fields are the destination node’s topology columns. Passed in so this crate need not depend on graphforge-storage.

Trait Implementations

impl Clone for ExpandNode

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ExpandNode

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

Formats the value using the given formatter.

impl Eq for ExpandNode

impl Hash for ExpandNode

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for ExpandNode

fn eq(&self, other: &Self) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl PartialOrd for ExpandNode

fn partial_cmp(&self, _other: &Self) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl StructuralPartialEq for ExpandNode

impl UserDefinedLogicalNodeCore for ExpandNode

fn name(&self) -> &str

Return the plan’s name.

fn inputs(&self) -> Vec<&LogicalPlan>

Return the logical plan’s inputs.

fn schema(&self) -> &DFSchemaRef

Return the output schema of this logical plan node.

fn expressions(&self) -> Vec<Expr>

Returns all expressions in the current logical plan node. This should not include expressions of any inputs (aka non-recursively). These expressions are used for optimizer passes and rewrites.

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

Write a single line, human readable string to f for use in explain plan.

fn with_exprs_and_inputs( &self, _exprs: Vec<Expr>, inputs: Vec<LogicalPlan>, ) -> DfResult<Self>

Create a new UserDefinedLogicalNode with the specified children and expressions. This function is used during optimization when the plan is being rewritten and a new instance of the UserDefinedLogicalNode must be created.

fn check_invariants( &self, _check: InvariantLevel, ) -> Result<(), DataFusionError>

Perform check of invariants for the extension node.

fn prevent_predicate_push_down_columns(&self) -> HashSet<String>

A list of output columns (e.g. the names of columns in self.schema()) for which predicates can not be pushed below this node without changing the output.

fn necessary_children_exprs( &self, _output_columns: &[usize], ) -> Option<Vec<Vec<usize>>>

Returns the necessary input columns for this node required to compute the columns in the output schema

fn supports_limit_pushdown(&self) -> bool

Returns true if a limit can be safely pushed down through this UserDefinedLogicalNode node.