Struct RecursiveCteProcessor

pub struct RecursiveCteProcessor;

Recursive CTE (Common Table Expression) processor for graph path queries Supports patterns like: WITH RECURSIVE paths AS (…) SELECT … FROM paths

Implementations

impl RecursiveCteProcessor

pub fn new() -> Self

pub fn find_recursive_paths( &self, edges: &[(String, String, f64)], start_node: &str, end_node: Option<&str>, config: &RecursiveQueryConfig, ) -> DataFusionResult<Vec<GraphPath>>

Process a recursive path query Example: Find all paths from node A to node B with max depth 5

pub fn find_shortest_paths( &self, edges: &[(String, String, f64)], start_node: &str, end_node: &str, max_depth: usize, ) -> DataFusionResult<Vec<GraphPath>>

Find shortest paths using recursive approach (for CTE queries)

pub fn find_reachable_nodes( &self, edges: &[(String, String, f64)], start_node: &str, max_depth: usize, ) -> DataFusionResult<Vec<String>>

Find all reachable nodes from a starting node (for CTE queries)

pub fn parse_and_execute_recursive_cte( &self, _cte_query: &str, edges: &[(String, String, f64)], ) -> DataFusionResult<Vec<GraphPath>>

Process a WITH RECURSIVE query (simplified parser) Example: “WITH RECURSIVE paths(source, target, depth) AS ( SELECT source, target, 1 FROM edges WHERE source = ‘A’ UNION ALL SELECT e.source, e.target, p.depth + 1 FROM edges e JOIN paths p ON e.source = p.target WHERE p.depth < 5 ) SELECT * FROM paths”

Trait Implementations

impl Default for RecursiveCteProcessor

fn default() -> Self

Returns the “default value” for a type.