Struct StructuralGraph 

pub struct StructuralGraph {
    pub graph: DiGraph<Node, Edge>,
    /* private fields */
}

Fields

graph: DiGraph<Node, Edge>

Implementations

impl StructuralGraph

pub fn from_graph(graph: DiGraph<Node, Edge>) -> Self

pub fn build_from_analysis(entries: &[FileAnalysisOutput]) -> Self

pub fn from_call_graph( entries: &[FileAnalysisOutput], call_graph: &CallGraph, ) -> Self

Build a StructuralGraph from an already-built CallGraph plus the same entries used to build it. Reuses CallGraph::callees (already-resolved caller/callee names, including scope-prefix stripping) instead of re-deriving Calls edges from entry.semantic.calls, so the expensive edge-resolution pass runs exactly once across both graphs. Node/symbol_index construction (Pass 1) is unavoidable since CallGraph does not track SymbolKind or imports. Note: unlike build_from_analysis, this does not have per-call arg_count available (CallEdge does not carry it), so candidate disambiguation falls back to same-file preference and line proximity only, without the arg-count tie-break stage.

pub fn bfs_blast_radius(&self, symbol: &str, depth: usize) -> Vec<NodeIndex>

pub fn blast_radius_subgraph( &self, symbol: &str, depth: usize, ) -> (Vec<NodeIndex>, Vec<(NodeIndex, NodeIndex, Edge)>)

Blast-radius subgraph including both nodes and edges.

Returns a tuple of (nodes, edges) where:

• nodes: Vec with the start symbol first, followed by all discovered nodes in BFS order
• edges: Vec<(NodeIndex, NodeIndex, Edge)> containing every edge whose source and target are both in the visited set (not just edges walked by the BFS tree), allowing clients to fully reconstruct the subgraph’s connectivity

If the symbol is not found, returns (vec![], vec![]).

pub fn render_subgraph_text(&self, nodes: &[NodeIndex]) -> String

Renders a subgraph defined by nodes into a prompt-ready string representation.

Formats function symbols grouped by file path:

// path/to/file.rs
fn name [calls: a, b] [callers: c]

Files are sorted lexicographically, functions within files are sorted by name. Non-Symbol nodes and non-Function SymbolKinds are skipped.

pub fn find_symbols(&self, names: &[&str]) -> Vec<NodeIndex>

Resolves multiple symbol names to their first matching NodeIndex in the symbol index.

pub fn blast_radius_bidirectional( &self, seeds: &[NodeIndex], max_nodes: usize, max_depth: usize, ) -> (Vec<NodeIndex>, Vec<(NodeIndex, NodeIndex, Edge)>)

Bidirectional blast-radius traversal discovering both callers and callees.

Walks both Direction::Incoming and Direction::Outgoing edges filtered to Edge::Calls. Caps the visited set at max_nodes and traversal depth at max_depth. Returns (nodes, edges) for the induced subgraph where all edges between visited nodes are included.

Trait Implementations

impl Clone for StructuralGraph

fn clone(&self) -> StructuralGraph

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for StructuralGraph

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for StructuralGraph

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Serialize for StructuralGraph

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.