Struct AsyncGraph 

pub struct AsyncGraph { /* private fields */ }

Async handle to a knowledge graph backed by a rusqlite::Connection.

Internally wraps the connection in Arc<Mutex<_>> so it can be shared across async tasks. All blocking SQL calls are offloaded to the Tokio blocking-thread pool.

Implementations

impl AsyncGraph

pub fn new(conn: Connection) -> Self

Wrap an already-initialised connection.

pub async fn open(path: impl Into<String>) -> Result<Self>

Open (or create) a database at path and initialise the graph schema.

pub async fn upsert_node(&self, node: GraphNode) -> Result<()>

Insert or replace a node.

pub async fn read_node( &self, id: impl Into<String>, ) -> Result<Option<GraphNode>>

Read a node by ID. Returns None if not found.

pub async fn delete_node(&self, id: impl Into<String>) -> Result<bool>

Delete a node by ID. Returns true if a row was deleted.

pub async fn append_edge(&self, edge: GraphEdge) -> Result<()>

Append an edge (duplicates by ID are ignored).

pub async fn append_edges(&self, edges: Vec<GraphEdge>) -> Result<()>

Append many edges in one transaction (duplicates by ID or by the (source, target, relation) unique index are ignored).

pub async fn edges_for_node_dir( &self, node_id: impl Into<String>, dir: EdgeDirection, relation: Option<String>, ) -> Result<Vec<GraphEdge>>

Read edges touching node_id, filtered by direction and optional relation.

pub async fn neighbors_weighted( &self, seed_ids: Vec<String>, dir: EdgeDirection, relation: Option<String>, ) -> Result<Vec<(String, f64)>>

1-hop neighbors of seed_ids (weighted sum), filtered by direction and an optional relation. Seed nodes are excluded.

pub async fn delete_edge(&self, id: impl Into<String>) -> Result<bool>

Delete an edge by ID. Returns true if a row was deleted.

pub async fn smart_recall( &self, project: Option<String>, hint: Option<String>, limit: usize, ) -> Result<Vec<ScoredNode>>

Run smart recall with composite scoring.

pub async fn search_nodes( &self, query: impl Into<String>, limit: usize, ) -> Result<Vec<GraphNode>>

Full-text search over node titles and bodies.

pub async fn stats(&self) -> Result<GraphStats>

Compute graph statistics (node/edge counts, avg importance).

Trait Implementations

impl Clone for AsyncGraph

fn clone(&self) -> AsyncGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.