Struct ArborGraph 

pub struct ArborGraph { /* private fields */ }

The code relationship graph.

This is the heart of Arbor. It stores all code entities as nodes and their relationships as edges, with indexes for fast access.

Implementations

impl ArborGraph

pub fn new() -> Self

Creates a new empty graph.

pub fn add_node(&mut self, node: CodeNode) -> NodeId

Adds a code node to the graph.

Returns the node’s index for adding edges later.

pub fn add_edge(&mut self, from: NodeId, to: NodeId, edge: Edge)

Adds an edge between two nodes.

pub fn get_by_id(&self, id: &str) -> Option<&CodeNode>

Gets a node by its string ID.

pub fn get(&self, index: NodeId) -> Option<&CodeNode>

Gets a node by its graph index.

pub fn find_by_name(&self, name: &str) -> Vec<&CodeNode>

Finds all nodes with a given name.

pub fn find_by_file(&self, file: &str) -> Vec<&CodeNode>

Finds all nodes in a file.

pub fn search(&self, query: &str) -> Vec<&CodeNode>

Searches for nodes whose name contains the query.

Uses the search index for fast O(k) lookups where k is the number of matches, instead of O(n) linear scan over all nodes.

pub fn get_callers(&self, index: NodeId) -> Vec<&CodeNode>

Gets nodes that call the given node.

pub fn get_callees(&self, index: NodeId) -> Vec<&CodeNode>

Gets nodes that this node calls.

pub fn get_dependents( &self, index: NodeId, max_depth: usize, ) -> Vec<(NodeId, usize)>

Gets all nodes that depend on the given node (directly or transitively).

pub fn remove_file(&mut self, file: &str)

Removes all nodes from a file. Used for incremental updates.

pub fn centrality(&self, index: NodeId) -> f64

Gets the centrality score for a node.

pub fn set_centrality(&mut self, scores: HashMap<NodeId, f64>)

Sets centrality scores (called after computation).

pub fn node_count(&self) -> usize

Returns the number of nodes.

pub fn edge_count(&self) -> usize

Returns the number of edges.

pub fn nodes(&self) -> impl Iterator<Item = &CodeNode>

Iterates over all nodes.

pub fn edges(&self) -> impl Iterator<Item = &Edge>

Iterates over all edges.

pub fn export_edges(&self) -> Vec<GraphEdge>

Returns all edges with source and target IDs for export.

pub fn node_indexes(&self) -> impl Iterator<Item = NodeId> + '_

Iterates over all node indexes.

pub fn find_path(&self, from: NodeId, to: NodeId) -> Option<Vec<&CodeNode>>

Finds the shortest path between two nodes.

pub fn get_index(&self, id: &str) -> Option<NodeId>

Gets the node index for a string ID.

impl ArborGraph

pub fn stats(&self) -> GraphStats

Returns graph statistics.

impl ArborGraph

pub fn analyze_impact(&self, target: NodeId, max_depth: usize) -> ImpactAnalysis

Analyzes the impact of changing a node.

Performs bidirectional BFS from the target:

• Upstream: nodes that depend on target (would break if target changes)
• Downstream: nodes target depends on (may require target updates)

Arguments

• target - The node to analyze
• max_depth - Maximum hop distance to traverse (0 = unlimited)

Returns

Complete impact analysis with affected nodes sorted by severity.

impl ArborGraph

pub fn slice_context( &self, target: NodeId, max_tokens: usize, max_depth: usize, pinned: &[NodeId], ) -> ContextSlice

Extracts a token-bounded context slice around a target node.

Collects nodes in BFS order:

1. Target node itself
2. Direct upstream (callers) at depth 1
3. Direct downstream (callees) at depth 1
4. Continues outward until budget or max_depth reached

Pinned nodes are always included regardless of budget.

Arguments

• target - The node to center the slice around
• max_tokens - Maximum token budget (0 = unlimited)
• max_depth - Maximum hop distance (0 = unlimited, default: 2)
• pinned - Nodes that must be included regardless of budget

Trait Implementations

impl Debug for ArborGraph

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

Formats the value using the given formatter.

impl Default for ArborGraph

fn default() -> Self

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for ArborGraph

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Serialize for ArborGraph

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

where __S: Serializer,

Serialize this value into the given Serde serializer.