Struct WeightedPathQuery 

pub struct WeightedPathQuery<'a> {
    pub path: RegularPathExpr,
    pub graph: &'a str,
    pub start_vertex: Option<VertexId>,
    pub weight_property: &'a str,
    pub default_edge_weight: f64,
    pub max_hops: usize,
    pub predicate: PathWeightPredicate,
    pub score: f64,
}

A bounded regular-path walk whose accumulated numeric edge weight must satisfy a caller-provided predicate.

Unlike reachability-only RPQ evaluation, weighted execution cannot collapse all visits to the same (vertex, DFA state): two walks can reach that configuration with different accumulated weights. max_hops therefore makes the walk domain explicit and finite. When several accepted walks end at the same vertex, the result retains the greatest accumulated weight and its concrete vertex / edge path.

Fields

path: RegularPathExpr

graph: &'a str

start_vertex: Option<VertexId>

weight_property: &'a str

default_edge_weight: f64

max_hops: usize

predicate: PathWeightPredicate

score: f64

Implementations

impl<'a> WeightedPathQuery<'a>

pub fn new( path: RegularPathExpr, graph: &'a str, weight_property: &'a str, predicate: PathWeightPredicate, ) -> Self

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

pub fn execute<G: GraphStore>( &self, store: &G, ) -> GraphStoreResult<GraphPostingList>