Struct GraphStore 

pub struct GraphStore { /* private fields */ }

SQLite-backed graph store for memory relationships.

Implementations

impl GraphStore

pub fn open(path: &Path) -> Result<Self>

Open or create the graph store using the given SQLite database path. Shares the same file as access.db.

pub fn add_node( &self, id: &str, project_id: Option<&str>, created_at: i64, ) -> Result<()>

Add a Memory node to the graph.

pub fn ensure_node_exists( &self, id: &str, project_id: Option<&str>, created_at: i64, ) -> Result<()>

Ensure a node exists in the graph. Creates it if missing (for backfill).

pub fn remove_node(&self, id: &str) -> Result<()>

Remove a Memory node and all its edges from the graph.

pub fn add_related_edge( &self, from_id: &str, to_id: &str, strength: f64, rel_type: &str, ) -> Result<()>

Add a RELATED edge between two Memory nodes.

pub fn add_supersedes_edge(&self, new_id: &str, old_id: &str) -> Result<()>

Add a SUPERSEDES edge from new_id to old_id.

pub fn get_neighbors( &self, ids: &[&str], min_strength: f64, ) -> Result<Vec<(String, String, f64)>>

Get 1-hop neighbors of the given item IDs via RELATED or SUPERSEDES edges. Returns (neighbor_id, rel_type, strength) tuples.

pub fn record_co_access(&self, item_ids: &[String]) -> Result<()>

Record co-access between pairs of item IDs. Creates or increments CO_ACCESSED edges.

pub fn get_co_accessed( &self, ids: &[&str], min_count: i64, ) -> Result<Vec<(String, i64)>>

Get items that are frequently co-accessed with the given IDs. Returns (neighbor_id, co_access_count) tuples.

pub fn transfer_edges(&self, from_id: &str, to_id: &str) -> Result<()>

Transfer all edges from one node to another (used during consolidation merge).

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

Detect triangles of RELATED items (for clustering). Returns sets of 3 item IDs that form triangles.

pub fn get_full_connections(&self, item_id: &str) -> Result<Vec<ConnectionInfo>>

Get full connection info for an item (all edge types).

pub fn get_edge_count(&self, item_id: &str) -> Result<u32>

Get the edge count for an item (total number of edges of all types).