Struct VertexMatch 

pub struct VertexMatch<'a> {
    pub graph: &'a str,
    pub label: Option<&'a str>,
    pub predicate: Option<VertexPredicate>,
    pub score: f64,
}

Single-vertex Match: every vertex in graph whose label matches and whose predicates all hold. Useful as a Cypher-style anchor.

Fields

graph: &'a str

label: Option<&'a str>

predicate: Option<VertexPredicate>

score: f64

Implementations

impl<'a> VertexMatch<'a>

pub fn new(graph: &'a str) -> Self

pub fn label(self, label: &'a str) -> Self

pub fn predicate(self, p: VertexPredicate) -> Self

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