Struct raphtory::db::graph::path::PathFromGraph

pub struct PathFromGraph<G: GraphViewOps> {
    pub graph: G,
    pub operations: Arc<Vec<Operations>>,
}

Fields

graph: G

operations: Arc<Vec<Operations>>

Implementations

impl<G: GraphViewOps> PathFromGraph<G>

pub fn new(graph: G, operation: Operations) -> PathFromGraph<G>

pub fn iter(&self) -> Box<dyn Iterator<Item = PathFromVertex<G>> + Send>

Trait Implementations

impl<G: Clone + GraphViewOps> Clone for PathFromGraph<G>

fn clone(&self) -> PathFromGraph<G>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<G: GraphViewOps> LayerOps for PathFromGraph<G>

type LayeredViewType = PathFromGraph<LayeredGraph<G>>

fn default_layer(&self) -> Self::LayeredViewType

Return a graph containing only the default edge layer

fn layer<L: Into<Layer>>(&self, name: L) -> Option<Self::LayeredViewType>

Return a graph containing the layer name

impl<G: GraphViewOps> TimeOps for PathFromGraph<G>

type WindowedViewType = PathFromGraph<WindowedGraph<G>>

fn start(&self) -> Option<i64>

Return the timestamp of the default start for perspectives of the view (if any).

fn end(&self) -> Option<i64>

Return the timestamp of the default for perspectives of the view (if any).

fn window<T: IntoTime>(&self, t_start: T, t_end: T) -> Self::WindowedViewType

Create a view including all events between t_start (inclusive) and t_end (exclusive)

fn window_size(&self) -> Option<u64>

Return the size of the window covered by this view

fn at<T: IntoTime>(&self, end: T) -> Self::WindowedViewType

Create a view including all events until end (inclusive)

fn expanding<I>(&self, step: I) -> Result<WindowSet<Self>, ParseTimeError>where Self: Sized + Clone + 'static, I: TryInto<Interval, Error = ParseTimeError>,

Creates a WindowSet with the given step size
using an expanding window. The last window may fall partially outside the range of the data/view.

fn rolling<I>( &self, window: I, step: Option<I> ) -> Result<WindowSet<Self>, ParseTimeError>where Self: Sized + Clone + 'static, I: TryInto<Interval, Error = ParseTimeError>,

Creates a WindowSet with the given window size and optional step using a rolling window. The last window may fall partially outside the range of the data/view.

impl<G: GraphViewOps> VertexViewOps for PathFromGraph<G>

type Graph = G

type ValueType<T> = Box<dyn Iterator<Item = Box<dyn Iterator<Item = T> + Send, Global>> + Send, Global>

type PathType<'a> = PathFromGraph<G> where Self: 'a

type EList = Box<dyn Iterator<Item = Box<dyn Iterator<Item = EdgeView<G>> + Send, Global>> + Send, Global>

fn id( &self ) -> Box<dyn Iterator<Item = Box<dyn Iterator<Item = u64> + Send>> + Send>

Get the numeric id of the vertex

fn name( &self ) -> Box<dyn Iterator<Item = Box<dyn Iterator<Item = String> + Send>> + Send>

Get the name of this vertex if a user has set one otherwise it returns the ID.

fn earliest_time(&self) -> Self::ValueType<Option<i64>>

Get the timestamp for the earliest activity of the vertex

fn latest_time(&self) -> Self::ValueType<Option<i64>>

Get the timestamp for the latest activity of the vertex

fn history( &self ) -> Box<dyn Iterator<Item = Box<dyn Iterator<Item = Vec<i64>> + Send>> + Send>

Gets the history of the vertex (time that the vertex was added and times when changes were made to the vertex)

fn properties( &self ) -> Box<dyn Iterator<Item = Box<dyn Iterator<Item = Properties<VertexView<G>>> + Send>> + Send>

Get a view of the temporal properties of this vertex.

fn degree( &self ) -> Box<dyn Iterator<Item = Box<dyn Iterator<Item = usize> + Send>> + Send>

Get the degree of this vertex (i.e., the number of edges that are incident to it).

fn in_degree( &self ) -> Box<dyn Iterator<Item = Box<dyn Iterator<Item = usize> + Send>> + Send>

Get the in-degree of this vertex (i.e., the number of edges that point into it).

fn out_degree( &self ) -> Box<dyn Iterator<Item = Box<dyn Iterator<Item = usize> + Send>> + Send>

Get the out-degree of this vertex (i.e., the number of edges that point out of it).

fn edges( &self ) -> Box<dyn Iterator<Item = Box<dyn Iterator<Item = EdgeView<G>> + Send>> + Send>

Get the edges that are incident to this vertex.

fn in_edges( &self ) -> Box<dyn Iterator<Item = Box<dyn Iterator<Item = EdgeView<G>> + Send>> + Send>

Get the edges that point into this vertex.

fn out_edges(&self) -> BoxedIter<BoxedIter<EdgeView<G>>>

Get the edges that point out of this vertex.

fn neighbours(&self) -> Self

Get the neighbours of this vertex.

fn in_neighbours(&self) -> Self

Get the neighbours of this vertex that point into this vertex.

fn out_neighbours(&self) -> Self

Get the neighbours of this vertex that point out of this vertex.