Struct VectorEnhancedMatch 

pub struct VectorEnhancedMatch<'a> {
    pub graph: &'a str,
    pub pattern: GraphPattern,
    pub query_vector: Vec<f64>,
    pub score_variable: String,
    pub vector_field: String,
    pub threshold: f64,
}

GMatch followed by a per-match cosine filter against the vertex bound to score_variable. Matches with similarity below threshold are dropped; surviving entries take the cosine value as their score.

Fields

graph: &'a str

pattern: GraphPattern

query_vector: Vec<f64>

score_variable: String

vector_field: String

threshold: f64

Implementations

impl<'a> VectorEnhancedMatch<'a>

pub fn new( graph: &'a str, pattern: GraphPattern, query_vector: Vec<f64>, score_variable: impl Into<String>, ) -> Self

pub fn vector_field(self, name: impl Into<String>) -> Self

pub fn threshold(self, t: f64) -> Self

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