Struct KnowledgeGraph 

pub struct KnowledgeGraph { /* private fields */ }

Implementations

impl KnowledgeGraph

pub fn get_node(&self, node_id: i64) -> Result<GraphNode>

pub fn find_nodes_by_kind(&self, kind: &str) -> Result<Vec<GraphNode>>

pub fn add_symbol( &self, name: &str, symbol_kind: &str, qualified_name: &str, span: &SourceSpan, language: &str, parent_id: Option<i64>, ) -> Result<i64>

pub fn add_file(&self, path: &str, language: &str, hash: &str) -> Result<i64>

pub fn add_discovery( &self, agent: &str, discovery_type: &str, target: &str, metadata: Value, ) -> Result<i64>

pub fn add_issue( &self, severity: &str, description: &str, rule_id: Option<&str>, ) -> Result<i64>

pub fn add_pattern( &self, pattern_type: &str, confidence: f64, description: &str, ) -> Result<i64>

pub fn add_knowledge( &self, source: &str, title: &str, tags: &[String], summary: &str, ) -> Result<i64>

pub fn add_hotspot( &self, complexity: u32, risk_score: f64, loop_depth: u32, description: &str, ) -> Result<i64>

pub fn add_cfg_block( &self, function_id: i64, block: &CfgBlockData, ) -> Result<i64>

impl KnowledgeGraph

pub fn resolve_fts5_by_magellan_id( &self, magellan_id: i64, ) -> Result<Option<i64>>

pub fn resolve_fts5(&self, keyword: &str) -> Result<Option<i64>>

pub fn insert_bridge_entry( &self, node_id: i64, magellan_id: i64, graph_file: &str, ) -> Result<()>

pub async fn sync_symbols(&self) -> Result<SyncReport>

pub async fn sync_references(&self) -> Result<SyncReport>

pub async fn query(&self, keyword: &str, depth: u32) -> Result<QueryResult>

impl KnowledgeGraph

pub fn add_edge( &self, from: i64, to: i64, edge_type: &str, data: Value, ) -> Result<i64>

pub fn add_correlation( &self, from: i64, to: i64, confidence: f64, agent: &str, ) -> Result<()>

pub fn callers_of( &self, symbol_id: i64, max_depth: u32, ) -> Result<Vec<GraphNode>>

pub fn callees_of( &self, symbol_id: i64, max_depth: u32, ) -> Result<Vec<GraphNode>>

pub fn correlated(&self, node_id: i64) -> Result<Vec<GraphNode>>

pub fn affected_by(&self, symbol_id: i64, depth: u32) -> Result<Vec<GraphNode>>

pub fn neighbors( &self, node_id: i64, edge_type: &str, direction: Direction, ) -> Result<Vec<GraphNode>>

pub fn shortest_path(&self, from: i64, to: i64) -> Result<Option<Vec<i64>>>

pub fn reachability(&self, from: i64) -> Result<Vec<i64>>

pub fn k_hop( &self, from: i64, depth: u32, direction: Direction, ) -> Result<Vec<i64>>

impl KnowledgeGraph

pub fn open(graph_path: &Path, db_path: &Path) -> Result<Self>

pub fn graph_path(&self) -> &Path

pub fn db_path(&self) -> &Path