Struct QueryEngine 

pub struct QueryEngine<'a> { /* private fields */ }

Query engine for graph traversal and analysis.

Implementations

impl<'a> QueryEngine<'a>

pub fn new(graph: &'a Graph) -> Self

pub fn impact(&self, node_id: &str) -> Vec<&'a Node>

Impact analysis: what nodes are affected if node_id changes? Follows reverse dependency edges (who depends on this node?). Traverses all edge relations by default.

pub fn impact_filtered( &self, node_id: &str, relations: Option<&[&str]>, ) -> Vec<&'a Node>

Impact analysis with optional relation filter. If relations is None, traverses all edge types.

pub fn deps(&self, node_id: &str, transitive: bool) -> Vec<&'a Node>

Dependencies: what does node_id depend on? (transitive) Traverses all edge relations by default.

pub fn deps_filtered( &self, node_id: &str, transitive: bool, relations: Option<&[&str]>, ) -> Vec<&'a Node>

Dependencies with optional relation filter. If relations is None, traverses all edge types.

pub fn path(&self, from: &str, to: &str) -> Option<Vec<String>>

Find shortest path between two nodes (any edge direction).

pub fn common_cause(&self, node_a: &str, node_b: &str) -> Vec<&'a Node>

Common cause: find shared dependencies of two nodes.

pub fn topological_sort(&self) -> Result<Vec<String>>

Topological sort (returns error if cycle detected).