Struct MemoryGraphEngine 

pub struct MemoryGraphEngine { /* private fields */ }

Thread-safe graph engine backed by a SQLite database.

Implementations

impl MemoryGraphEngine

pub fn open(path: &str) -> Result<Self, Error>

Open (or create) a graph database at the given path. Pass ":memory:" for an ephemeral in-process database.

pub fn upsert_edge(&self, edge: &GraphEdge) -> Result<(), Error>

Upsert a single directed edge (idempotent).

pub fn remove_memory(&self, memory_id: &str) -> Result<(), Error>

Delete all edges involving a memory (used when a memory is forgotten).

pub fn get_edges(&self, memory_id: &str) -> Vec<GraphEdge>

Return all edges incident to a memory (both outbound and inbound).

pub fn traverse( &self, root_id: &str, max_depth: u32, namespace: &str, ) -> Vec<GraphNode>

BFS traversal starting from root_id up to max_depth. Returns nodes in BFS order, each annotated with depth and incoming edges.

pub fn shortest_path( &self, from_id: &str, to_id: &str, namespace: &str, ) -> Option<Vec<String>>

BFS shortest path between two memories. Returns the sequence of memory IDs from from_id to to_id, inclusive. Returns None if no path exists.

pub fn export(&self, namespace: &str) -> GraphExport

Export all edges in a namespace.

pub fn insert_audit_event(&self, event: &AuditEventInsert) -> Result<(), Error>

Insert a business-event audit record.

pub fn query_audit_events( &self, agent_id: Option<&str>, event_type: Option<&str>, from_ts: Option<u64>, to_ts: Option<u64>, limit: usize, ) -> Vec<AuditEvent>

Query audit events with optional filters.

Uses always-bound params with IS-NULL guards so the query is pre-compiled once and indexes are still usable for the common single-filter case.

pub fn build_edges_for_new_memory( &self, new_id: &str, new_embedding: &[f32], new_tags: &[String], new_created_at: u64, namespace: &str, existing: &[(String, Vec<f32>, Vec<String>, u64)], )

Build edges for a newly stored memory.

This is called from store_memory inside a tokio::spawn so it does not block the HTTP response. It computes:

• related_to edges for all existing memories with cosine ≥ 0.85
• shares_entity edges for memories sharing at least one entity:* tag
• precedes edges when memory A was stored before memory B and they also qualify as related_to

Trait Implementations

impl Clone for MemoryGraphEngine

fn clone(&self) -> MemoryGraphEngine

Returns a duplicate of the value.

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

Performs copy-assignment from source.