pub trait RuntimeGraphPort {
Show 13 methods
// Required methods
fn resolve_graph_projection(
&self,
name: Option<&str>,
inline: Option<RuntimeGraphProjection>,
) -> Result<Option<RuntimeGraphProjection>, RedDBError>;
fn graph_neighborhood(
&self,
node: &str,
direction: RuntimeGraphDirection,
max_depth: usize,
edge_labels: Option<Vec<String>>,
projection: Option<RuntimeGraphProjection>,
) -> Result<RuntimeGraphNeighborhoodResult, RedDBError>;
fn graph_traverse(
&self,
source: &str,
direction: RuntimeGraphDirection,
max_depth: usize,
strategy: RuntimeGraphTraversalStrategy,
edge_labels: Option<Vec<String>>,
projection: Option<RuntimeGraphProjection>,
) -> Result<RuntimeGraphTraversalResult, RedDBError>;
fn graph_shortest_path(
&self,
source: &str,
target: &str,
direction: RuntimeGraphDirection,
algorithm: RuntimeGraphPathAlgorithm,
edge_labels: Option<Vec<String>>,
projection: Option<RuntimeGraphProjection>,
) -> Result<RuntimeGraphPathResult, RedDBError>;
fn graph_components(
&self,
mode: RuntimeGraphComponentsMode,
min_size: usize,
projection: Option<RuntimeGraphProjection>,
) -> Result<RuntimeGraphComponentsResult, RedDBError>;
fn graph_centrality(
&self,
algorithm: RuntimeGraphCentralityAlgorithm,
top_k: usize,
normalize: bool,
max_iterations: Option<usize>,
epsilon: Option<f64>,
alpha: Option<f64>,
projection: Option<RuntimeGraphProjection>,
) -> Result<RuntimeGraphCentralityResult, RedDBError>;
fn graph_communities(
&self,
algorithm: RuntimeGraphCommunityAlgorithm,
min_size: usize,
max_iterations: Option<usize>,
resolution: Option<f64>,
projection: Option<RuntimeGraphProjection>,
) -> Result<RuntimeGraphCommunityResult, RedDBError>;
fn graph_clustering(
&self,
top_k: usize,
include_triangles: bool,
projection: Option<RuntimeGraphProjection>,
) -> Result<RuntimeGraphClusteringResult, RedDBError>;
fn graph_personalized_pagerank(
&self,
seeds: Vec<String>,
top_k: usize,
alpha: Option<f64>,
epsilon: Option<f64>,
max_iterations: Option<usize>,
projection: Option<RuntimeGraphProjection>,
) -> Result<RuntimeGraphCentralityResult, RedDBError>;
fn graph_hits(
&self,
top_k: usize,
epsilon: Option<f64>,
max_iterations: Option<usize>,
projection: Option<RuntimeGraphProjection>,
) -> Result<RuntimeGraphHitsResult, RedDBError>;
fn graph_cycles(
&self,
max_length: usize,
max_cycles: usize,
projection: Option<RuntimeGraphProjection>,
) -> Result<RuntimeGraphCyclesResult, RedDBError>;
fn graph_topological_sort(
&self,
projection: Option<RuntimeGraphProjection>,
) -> Result<RuntimeGraphTopologicalSortResult, RedDBError>;
fn graph_properties(
&self,
projection: Option<RuntimeGraphProjection>,
) -> Result<RuntimeGraphPropertiesResult, RedDBError>;
}Required Methods§
fn resolve_graph_projection( &self, name: Option<&str>, inline: Option<RuntimeGraphProjection>, ) -> Result<Option<RuntimeGraphProjection>, RedDBError>
fn graph_neighborhood( &self, node: &str, direction: RuntimeGraphDirection, max_depth: usize, edge_labels: Option<Vec<String>>, projection: Option<RuntimeGraphProjection>, ) -> Result<RuntimeGraphNeighborhoodResult, RedDBError>
fn graph_traverse( &self, source: &str, direction: RuntimeGraphDirection, max_depth: usize, strategy: RuntimeGraphTraversalStrategy, edge_labels: Option<Vec<String>>, projection: Option<RuntimeGraphProjection>, ) -> Result<RuntimeGraphTraversalResult, RedDBError>
fn graph_shortest_path( &self, source: &str, target: &str, direction: RuntimeGraphDirection, algorithm: RuntimeGraphPathAlgorithm, edge_labels: Option<Vec<String>>, projection: Option<RuntimeGraphProjection>, ) -> Result<RuntimeGraphPathResult, RedDBError>
fn graph_components( &self, mode: RuntimeGraphComponentsMode, min_size: usize, projection: Option<RuntimeGraphProjection>, ) -> Result<RuntimeGraphComponentsResult, RedDBError>
fn graph_centrality( &self, algorithm: RuntimeGraphCentralityAlgorithm, top_k: usize, normalize: bool, max_iterations: Option<usize>, epsilon: Option<f64>, alpha: Option<f64>, projection: Option<RuntimeGraphProjection>, ) -> Result<RuntimeGraphCentralityResult, RedDBError>
fn graph_communities( &self, algorithm: RuntimeGraphCommunityAlgorithm, min_size: usize, max_iterations: Option<usize>, resolution: Option<f64>, projection: Option<RuntimeGraphProjection>, ) -> Result<RuntimeGraphCommunityResult, RedDBError>
fn graph_clustering( &self, top_k: usize, include_triangles: bool, projection: Option<RuntimeGraphProjection>, ) -> Result<RuntimeGraphClusteringResult, RedDBError>
fn graph_personalized_pagerank( &self, seeds: Vec<String>, top_k: usize, alpha: Option<f64>, epsilon: Option<f64>, max_iterations: Option<usize>, projection: Option<RuntimeGraphProjection>, ) -> Result<RuntimeGraphCentralityResult, RedDBError>
fn graph_hits( &self, top_k: usize, epsilon: Option<f64>, max_iterations: Option<usize>, projection: Option<RuntimeGraphProjection>, ) -> Result<RuntimeGraphHitsResult, RedDBError>
fn graph_cycles( &self, max_length: usize, max_cycles: usize, projection: Option<RuntimeGraphProjection>, ) -> Result<RuntimeGraphCyclesResult, RedDBError>
fn graph_topological_sort( &self, projection: Option<RuntimeGraphProjection>, ) -> Result<RuntimeGraphTopologicalSortResult, RedDBError>
fn graph_properties( &self, projection: Option<RuntimeGraphProjection>, ) -> Result<RuntimeGraphPropertiesResult, RedDBError>
Dyn Compatibility§
This trait is dyn compatible.
In older versions of Rust, dyn compatibility was called "object safety".