pub struct GraphUseCases<'a, P>where
P: ?Sized,{ /* private fields */ }Implementations§
Source§impl<'a, P> GraphUseCases<'a, P>where
P: RuntimeGraphPort + ?Sized,
impl<'a, P> GraphUseCases<'a, P>where
P: RuntimeGraphPort + ?Sized,
pub fn new(runtime: &'a P) -> GraphUseCases<'a, P>
pub fn neighborhood( &self, input: GraphNeighborhoodInput, ) -> Result<RuntimeGraphNeighborhoodResult, RedDBError>
pub fn traverse( &self, input: GraphTraversalInput, ) -> Result<RuntimeGraphTraversalResult, RedDBError>
pub fn shortest_path( &self, input: GraphShortestPathInput, ) -> Result<RuntimeGraphPathResult, RedDBError>
pub fn components( &self, input: GraphComponentsInput, ) -> Result<RuntimeGraphComponentsResult, RedDBError>
pub fn centrality( &self, input: GraphCentralityInput, ) -> Result<RuntimeGraphCentralityResult, RedDBError>
pub fn communities( &self, input: GraphCommunitiesInput, ) -> Result<RuntimeGraphCommunityResult, RedDBError>
pub fn clustering( &self, input: GraphClusteringInput, ) -> Result<RuntimeGraphClusteringResult, RedDBError>
pub fn personalized_pagerank( &self, input: GraphPersonalizedPageRankInput, ) -> Result<RuntimeGraphCentralityResult, RedDBError>
pub fn hits( &self, input: GraphHitsInput, ) -> Result<RuntimeGraphHitsResult, RedDBError>
pub fn cycles( &self, input: GraphCyclesInput, ) -> Result<RuntimeGraphCyclesResult, RedDBError>
pub fn topological_sort( &self, input: GraphTopologicalSortInput, ) -> Result<RuntimeGraphTopologicalSortResult, RedDBError>
pub fn properties( &self, input: GraphPropertiesInput, ) -> Result<RuntimeGraphPropertiesResult, RedDBError>
pub fn resolve_projection( &self, name: Option<&str>, inline: Option<RuntimeGraphProjection>, ) -> Result<Option<RuntimeGraphProjection>, RedDBError>
Auto Trait Implementations§
impl<'a, P> Freeze for GraphUseCases<'a, P>where
P: ?Sized,
impl<'a, P> RefUnwindSafe for GraphUseCases<'a, P>where
P: RefUnwindSafe + ?Sized,
impl<'a, P> Send for GraphUseCases<'a, P>
impl<'a, P> Sync for GraphUseCases<'a, P>
impl<'a, P> Unpin for GraphUseCases<'a, P>where
P: ?Sized,
impl<'a, P> UnsafeUnpin for GraphUseCases<'a, P>where
P: ?Sized,
impl<'a, P> UnwindSafe for GraphUseCases<'a, P>where
P: RefUnwindSafe + ?Sized,
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> IntoRequest<T> for T
impl<T> IntoRequest<T> for T
Source§fn into_request(self) -> Request<T>
fn into_request(self) -> Request<T>
Wrap the input message
T in a tonic::Request