Struct TemporalTraverse 

pub struct TemporalTraverse<'a> {
    pub start_vertex: VertexId,
    pub graph: &'a str,
    pub label: Option<&'a str>,
    pub max_hops: u32,
    pub filter: TemporalFilter,
    pub score: f64,
}

BFS traversal that applies a TemporalFilter to every candidate edge before it is followed. Mirrors the structure of crate::Traverse but with the filter step inlined.

Fields

start_vertex: VertexId

graph: &'a str

label: Option<&'a str>

max_hops: u32

filter: TemporalFilter

score: f64

Implementations

impl<'a> TemporalTraverse<'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 filter(self, filter: TemporalFilter) -> Self

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