Struct MultiGraphProcessor

pub struct MultiGraphProcessor;

Multi-graph processor for handling multiple graphs in a single query Supports queries like: SELECT * FROM graph1.edges UNION SELECT * FROM graph2.edges

Implementations

impl MultiGraphProcessor

pub fn new() -> Self

pub fn create_graph( &self, name: &str, edges: Vec<MultiGraphEdge>, properties: Option<HashMap<String, String>>, ) -> DataFusionResult<NamedGraph>

Create a new named graph

pub fn merge_graphs( &self, graphs: &[NamedGraph], config: &MultiGraphConfig, ) -> DataFusionResult<NamedGraph>

Merge multiple graphs into a single graph

pub fn query_multi_graph( &self, graphs: &[NamedGraph], graph_names: Option<&[String]>, edge_filter: Option<Box<dyn Fn(&MultiGraphEdge) -> bool>>, ) -> DataFusionResult<Vec<MultiGraphEdge>>

Query edges across multiple graphs

pub fn find_cross_graph_connections( &self, graphs: &[NamedGraph], ) -> DataFusionResult<Vec<(String, String, Vec<String>)>>

Find cross-graph connections (edges that span multiple graphs)

pub fn calculate_graph_similarity( &self, graph1: &NamedGraph, graph2: &NamedGraph, ) -> DataFusionResult<f64>

Calculate graph similarity between two graphs

pub fn get_multi_graph_statistics( &self, graphs: &[NamedGraph], ) -> DataFusionResult<HashMap<String, GraphStatistics>>

Get graph statistics for multiple graphs

Trait Implementations

impl Default for MultiGraphProcessor

fn default() -> Self

Returns the “default value” for a type.