Struct WeightedPathQueryOperator 

pub struct WeightedPathQueryOperator {
    pub path_expr: RegularPathExpr,
    pub graph_store: Arc<MemoryGraphStore>,
    pub graph_name: String,
    pub start_vertex: Option<u64>,
    pub weight_property: String,
    pub default_edge_weight: f64,
    pub max_hops: usize,
    pub predicate: PathWeightPredicate,
    pub predicate_selectivity: f64,
    pub score: f64,
}

WeightedPathQueryOperator evaluates bounded DFA walks, sums a numeric edge property, and keeps endpoints for which the accumulated weight passes predicate. The selectivity value is retained solely for planning; it never substitutes for physical predicate evaluation.

Fields

path_expr: RegularPathExpr

graph_store: Arc<MemoryGraphStore>

graph_name: String

start_vertex: Option<u64>

weight_property: String

default_edge_weight: f64

max_hops: usize

predicate: PathWeightPredicate

predicate_selectivity: f64

score: f64

Implementations

impl WeightedPathQueryOperator

pub fn new( path_expr: RegularPathExpr, graph_store: Arc<MemoryGraphStore>, graph_name: impl Into<String>, ) -> Self

pub fn from_vertex(self, start: u64) -> Self

pub fn with_predicate_selectivity(self, sel: f64) -> Self

pub fn with_predicate( self, predicate: impl Fn(f64) -> bool + Send + Sync + 'static, selectivity: f64, ) -> Self

pub fn with_weight_property(self, property: impl Into<String>) -> Self

pub fn with_default_edge_weight(self, weight: f64) -> Self

pub fn with_max_hops(self, max_hops: usize) -> Self

pub fn with_score(self, score: f64) -> Self

Trait Implementations

impl Operator for WeightedPathQueryOperator

fn execute(&self, _ctx: &ExecutionContext) -> OperatorResult

fn cost_estimate(&self, stats: &IndexStats) -> f64