Struct Traverse 

pub struct Traverse<'a> {
    pub start_vertex: VertexId,
    pub graph: &'a str,
    pub label: Option<&'a str>,
    pub max_hops: u32,
    pub vertex_predicate: Option<VertexPredicate>,
    pub score: f64,
}

Traverse_{v,l,k} (Definition 2.2.1): BFS from start_vertex along edges with label (any label when None) up to max_hops hops. Each visited vertex becomes its own entry in the result.

Fields

start_vertex: VertexId

graph: &'a str

label: Option<&'a str>

max_hops: u32

vertex_predicate: Option<VertexPredicate>

score: f64

Implementations

impl<'a> Traverse<'a>

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

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

pub fn max_hops(self, hops: u32) -> Self

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

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