arbor-graph 2.0.0

Graph schema and relationship tracking for Arbor
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59

//! Arbor Graph - Code relationship management
//!
//! This crate manages the graph of code entities and their relationships.
//! It provides fast lookups, traversals, and centrality scoring for
//! prioritizing context in AI queries.
//!
//! # Architecture
//!
//! The graph uses petgraph internally with additional indexes for:
//! - Name-based lookups
//! - File-based grouping (for incremental updates)
//! - Kind-based filtering
//!
//! # Example
//!
//! ```no_run
//! use arbor_graph::ArborGraph;
//! use arbor_core::{CodeNode, NodeKind};
//!
//! let mut graph = ArborGraph::new();
//!
//! // Add nodes from parsing
//! let node = CodeNode::new("validate", "UserService.validate", NodeKind::Method, "user.rs");
//! let id = graph.add_node(node);
//!
//! // Query the graph
//! let matches = graph.find_by_name("validate");
//! ```

mod builder;
mod confidence;
mod edge;
mod graph;
mod heuristics;
mod impact;
mod query;
mod ranking;
mod search_index;
mod slice;

pub mod store;
pub mod symbol_table;

pub use search_index::SearchIndex;

pub use builder::GraphBuilder;
pub use confidence::{ConfidenceExplanation, ConfidenceLevel, NodeRole};
pub use edge::{Edge, EdgeKind, GraphEdge};
pub use graph::{ArborGraph, NodeId};
pub use heuristics::{
    detect_analysis_limitations, AnalysisWarning, HeuristicsMatcher, UncertainEdge,
    UncertainEdgeKind,
};
pub use impact::{AffectedNode, ImpactAnalysis, ImpactDirection, ImpactSeverity};
pub use query::{DependentInfo, ImpactResult, NodeInfo, QueryResult};
pub use ranking::{compute_centrality, CentralityScores};
pub use slice::{ContextNode, ContextSlice, TruncationReason};
pub use store::{GraphStore, StoreError};
pub use symbol_table::SymbolTable;