Skip to main content

RuntimeGraphPort

reddb_server::application::ports

Trait RuntimeGraphPort 

Source 
pub trait RuntimeGraphPort {

Show 13 methods    // Required methods
    fn resolve_graph_projection(
        &self,
        name: Option<&str>,
        inline: Option<RuntimeGraphProjection>,
    ) -> RedDBResult<Option<RuntimeGraphProjection>>;
    fn graph_neighborhood(
        &self,
        node: &str,
        direction: RuntimeGraphDirection,
        max_depth: usize,
        edge_labels: Option<Vec<String>>,
        projection: Option<RuntimeGraphProjection>,
    ) -> RedDBResult<RuntimeGraphNeighborhoodResult>;
    fn graph_traverse(
        &self,
        source: &str,
        direction: RuntimeGraphDirection,
        max_depth: usize,
        strategy: RuntimeGraphTraversalStrategy,
        edge_labels: Option<Vec<String>>,
        projection: Option<RuntimeGraphProjection>,
    ) -> RedDBResult<RuntimeGraphTraversalResult>;
    fn graph_shortest_path(
        &self,
        source: &str,
        target: &str,
        direction: RuntimeGraphDirection,
        algorithm: RuntimeGraphPathAlgorithm,
        edge_labels: Option<Vec<String>>,
        projection: Option<RuntimeGraphProjection>,
    ) -> RedDBResult<RuntimeGraphPathResult>;
    fn graph_components(
        &self,
        mode: RuntimeGraphComponentsMode,
        min_size: usize,
        projection: Option<RuntimeGraphProjection>,
    ) -> RedDBResult<RuntimeGraphComponentsResult>;
    fn graph_centrality(
        &self,
        algorithm: RuntimeGraphCentralityAlgorithm,
        top_k: usize,
        normalize: bool,
        max_iterations: Option<usize>,
        epsilon: Option<f64>,
        alpha: Option<f64>,
        projection: Option<RuntimeGraphProjection>,
    ) -> RedDBResult<RuntimeGraphCentralityResult>;
    fn graph_communities(
        &self,
        algorithm: RuntimeGraphCommunityAlgorithm,
        min_size: usize,
        max_iterations: Option<usize>,
        resolution: Option<f64>,
        projection: Option<RuntimeGraphProjection>,
    ) -> RedDBResult<RuntimeGraphCommunityResult>;
    fn graph_clustering(
        &self,
        top_k: usize,
        include_triangles: bool,
        projection: Option<RuntimeGraphProjection>,
    ) -> RedDBResult<RuntimeGraphClusteringResult>;
    fn graph_personalized_pagerank(
        &self,
        seeds: Vec<String>,
        top_k: usize,
        alpha: Option<f64>,
        epsilon: Option<f64>,
        max_iterations: Option<usize>,
        projection: Option<RuntimeGraphProjection>,
    ) -> RedDBResult<RuntimeGraphCentralityResult>;
    fn graph_hits(
        &self,
        top_k: usize,
        epsilon: Option<f64>,
        max_iterations: Option<usize>,
        projection: Option<RuntimeGraphProjection>,
    ) -> RedDBResult<RuntimeGraphHitsResult>;
    fn graph_cycles(
        &self,
        max_length: usize,
        max_cycles: usize,
        projection: Option<RuntimeGraphProjection>,
    ) -> RedDBResult<RuntimeGraphCyclesResult>;
    fn graph_topological_sort(
        &self,
        projection: Option<RuntimeGraphProjection>,
    ) -> RedDBResult<RuntimeGraphTopologicalSortResult>;
    fn graph_properties(
        &self,
        projection: Option<RuntimeGraphProjection>,
    ) -> RedDBResult<RuntimeGraphPropertiesResult>;

}

Required Methods§

Source

fn resolve_graph_projection( &self, name: Option<&str>, inline: Option<RuntimeGraphProjection>, ) -> RedDBResult<Option<RuntimeGraphProjection>>

Source

fn graph_neighborhood( &self, node: &str, direction: RuntimeGraphDirection, max_depth: usize, edge_labels: Option<Vec<String>>, projection: Option<RuntimeGraphProjection>, ) -> RedDBResult<RuntimeGraphNeighborhoodResult>

Source

fn graph_traverse( &self, source: &str, direction: RuntimeGraphDirection, max_depth: usize, strategy: RuntimeGraphTraversalStrategy, edge_labels: Option<Vec<String>>, projection: Option<RuntimeGraphProjection>, ) -> RedDBResult<RuntimeGraphTraversalResult>

Source

fn graph_shortest_path( &self, source: &str, target: &str, direction: RuntimeGraphDirection, algorithm: RuntimeGraphPathAlgorithm, edge_labels: Option<Vec<String>>, projection: Option<RuntimeGraphProjection>, ) -> RedDBResult<RuntimeGraphPathResult>

Source

fn graph_components( &self, mode: RuntimeGraphComponentsMode, min_size: usize, projection: Option<RuntimeGraphProjection>, ) -> RedDBResult<RuntimeGraphComponentsResult>

Source

fn graph_centrality( &self, algorithm: RuntimeGraphCentralityAlgorithm, top_k: usize, normalize: bool, max_iterations: Option<usize>, epsilon: Option<f64>, alpha: Option<f64>, projection: Option<RuntimeGraphProjection>, ) -> RedDBResult<RuntimeGraphCentralityResult>

Source

fn graph_communities( &self, algorithm: RuntimeGraphCommunityAlgorithm, min_size: usize, max_iterations: Option<usize>, resolution: Option<f64>, projection: Option<RuntimeGraphProjection>, ) -> RedDBResult<RuntimeGraphCommunityResult>

Source

fn graph_clustering( &self, top_k: usize, include_triangles: bool, projection: Option<RuntimeGraphProjection>, ) -> RedDBResult<RuntimeGraphClusteringResult>

Source

fn graph_personalized_pagerank( &self, seeds: Vec<String>, top_k: usize, alpha: Option<f64>, epsilon: Option<f64>, max_iterations: Option<usize>, projection: Option<RuntimeGraphProjection>, ) -> RedDBResult<RuntimeGraphCentralityResult>

Source

fn graph_hits( &self, top_k: usize, epsilon: Option<f64>, max_iterations: Option<usize>, projection: Option<RuntimeGraphProjection>, ) -> RedDBResult<RuntimeGraphHitsResult>

Source

fn graph_cycles( &self, max_length: usize, max_cycles: usize, projection: Option<RuntimeGraphProjection>, ) -> RedDBResult<RuntimeGraphCyclesResult>

Source

fn graph_topological_sort( &self, projection: Option<RuntimeGraphProjection>, ) -> RedDBResult<RuntimeGraphTopologicalSortResult>

Source

fn graph_properties( &self, projection: Option<RuntimeGraphProjection>, ) -> RedDBResult<RuntimeGraphPropertiesResult>

Implementors§