Struct EmbeddedClient 

pub struct EmbeddedClient { /* private fields */ }

In-process client that wraps a GraphStore directly.

No network overhead — queries execute in the same process. Ideal for examples, tests, and embedded applications.

Implementations

impl EmbeddedClient

pub fn new() -> Self

Create a new EmbeddedClient with a fresh empty graph store

pub fn with_store(store: Arc<RwLock<GraphStore>>) -> Self

Create an EmbeddedClient wrapping an existing store

pub fn store(&self) -> &Arc<RwLock<GraphStore>>

Get a reference to the underlying store (for direct graph manipulation)

pub async fn store_read(&self) -> RwLockReadGuard<'_, GraphStore>

Acquire a read lock on the store.

Use for direct read-only access to graph data (node/edge lookups, iterations).

pub async fn store_write(&self) -> RwLockWriteGuard<'_, GraphStore>

Acquire a write lock on the store.

Use for direct mutation (create_node, set_property, etc.).

pub fn nlq_pipeline(&self, config: NLQConfig) -> Result<NLQPipeline, NLQError>

Create an NLQ pipeline for natural language → Cypher translation.

pub fn agent_runtime(&self, config: AgentConfig) -> AgentRuntime

Create an agent runtime for agentic enrichment workflows.

pub fn persistence_manager( &self, base_path: impl AsRef<Path>, ) -> Result<PersistenceManager, PersistenceError>

Create a persistence manager for durable storage.

pub fn cache_stats(&self) -> &CacheStats

Return AST cache statistics (hits, misses).

pub async fn export_snapshot( &self, _tenant: &str, path: &Path, ) -> Result<ExportStats, Box<dyn Error>>

Export a snapshot of the current graph store to a file.

pub async fn import_snapshot( &self, _tenant: &str, path: &Path, ) -> Result<ImportStats, Box<dyn Error>>

Import a snapshot into the current graph store from a file.

Trait Implementations

impl AlgorithmClient for EmbeddedClient

fn build_view<'life0, 'life1, 'life2, 'life3, 'async_trait>( &'life0 self, label: Option<&'life1 str>, edge_type: Option<&'life2 str>, weight_prop: Option<&'life3 str>, ) -> Pin<Box<dyn Future<Output = GraphView> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait, 'life2: 'async_trait, 'life3: 'async_trait,

Build a GraphView projection for algorithm execution.

fn page_rank<'life0, 'life1, 'life2, 'async_trait>( &'life0 self, config: PageRankConfig, label: Option<&'life1 str>, edge_type: Option<&'life2 str>, ) -> Pin<Box<dyn Future<Output = HashMap<u64, f64>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait, 'life2: 'async_trait,

Run PageRank on the graph (or a subgraph filtered by label/edge_type).

fn weakly_connected_components<'life0, 'life1, 'life2, 'async_trait>( &'life0 self, label: Option<&'life1 str>, edge_type: Option<&'life2 str>, ) -> Pin<Box<dyn Future<Output = WccResult> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait, 'life2: 'async_trait,

Detect weakly connected components.

fn strongly_connected_components<'life0, 'life1, 'life2, 'async_trait>( &'life0 self, label: Option<&'life1 str>, edge_type: Option<&'life2 str>, ) -> Pin<Box<dyn Future<Output = SccResult> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait, 'life2: 'async_trait,

Detect strongly connected components.

fn bfs<'life0, 'life1, 'life2, 'async_trait>( &'life0 self, source: u64, target: u64, label: Option<&'life1 str>, edge_type: Option<&'life2 str>, ) -> Pin<Box<dyn Future<Output = Option<PathResult>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait, 'life2: 'async_trait,

Breadth-first search from source to target.

fn dijkstra<'life0, 'life1, 'life2, 'life3, 'async_trait>( &'life0 self, source: u64, target: u64, label: Option<&'life1 str>, edge_type: Option<&'life2 str>, weight_prop: Option<&'life3 str>, ) -> Pin<Box<dyn Future<Output = Option<PathResult>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait, 'life2: 'async_trait, 'life3: 'async_trait,

Dijkstra’s shortest path from source to target (weighted).

fn edmonds_karp<'life0, 'life1, 'life2, 'async_trait>( &'life0 self, source: u64, sink: u64, label: Option<&'life1 str>, edge_type: Option<&'life2 str>, ) -> Pin<Box<dyn Future<Output = Option<FlowResult>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait, 'life2: 'async_trait,

Edmonds-Karp maximum flow from source to sink.

fn prim_mst<'life0, 'life1, 'life2, 'life3, 'async_trait>( &'life0 self, label: Option<&'life1 str>, edge_type: Option<&'life2 str>, weight_prop: Option<&'life3 str>, ) -> Pin<Box<dyn Future<Output = MSTResult> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait, 'life2: 'async_trait, 'life3: 'async_trait,

Prim’s minimum spanning tree.

fn count_triangles<'life0, 'life1, 'life2, 'async_trait>( &'life0 self, label: Option<&'life1 str>, edge_type: Option<&'life2 str>, ) -> Pin<Box<dyn Future<Output = usize> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait, 'life2: 'async_trait,

Count triangles in the graph.

fn bfs_all_shortest_paths<'life0, 'life1, 'life2, 'async_trait>( &'life0 self, source: u64, target: u64, label: Option<&'life1 str>, edge_type: Option<&'life2 str>, ) -> Pin<Box<dyn Future<Output = Vec<PathResult>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait, 'life2: 'async_trait,

Find all shortest paths between source and target (BFS).

fn cdlp<'life0, 'life1, 'life2, 'async_trait>( &'life0 self, config: CdlpConfig, label: Option<&'life1 str>, edge_type: Option<&'life2 str>, ) -> Pin<Box<dyn Future<Output = CdlpResult> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait, 'life2: 'async_trait,

Community Detection via Label Propagation (CDLP).

fn local_clustering_coefficient<'life0, 'life1, 'life2, 'async_trait>( &'life0 self, label: Option<&'life1 str>, edge_type: Option<&'life2 str>, ) -> Pin<Box<dyn Future<Output = LccResult> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait, 'life2: 'async_trait,

Local Clustering Coefficient for all nodes.

fn pca<'life0, 'life1, 'life2, 'life3, 'async_trait>( &'life0 self, label: Option<&'life1 str>, properties: &'life2 [&'life3 str], config: PcaConfig, ) -> Pin<Box<dyn Future<Output = PcaResult> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait, 'life2: 'async_trait, 'life3: 'async_trait,

Principal Component Analysis on node numeric properties.

impl Default for EmbeddedClient

fn default() -> Self

Returns the “default value” for a type.

impl GraphmindClient for EmbeddedClient

fn query<'life0, 'life1, 'life2, 'async_trait>( &'life0 self, graph: &'life1 str, cypher: &'life2 str, ) -> Pin<Box<dyn Future<Output = GraphmindResult<QueryResult>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait, 'life2: 'async_trait,

Execute a read-write Cypher query

fn query_with_params<'life0, 'life1, 'life2, 'async_trait>( &'life0 self, graph: &'life1 str, cypher: &'life2 str, params: HashMap<String, Value>, ) -> Pin<Box<dyn Future<Output = GraphmindResult<QueryResult>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait, 'life2: 'async_trait,

Execute a read-write Cypher query with parameters

fn query_readonly<'life0, 'life1, 'life2, 'async_trait>( &'life0 self, _graph: &'life1 str, cypher: &'life2 str, ) -> Pin<Box<dyn Future<Output = GraphmindResult<QueryResult>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait, 'life2: 'async_trait,

Execute a read-only Cypher query

fn delete_graph<'life0, 'life1, 'async_trait>( &'life0 self, _graph: &'life1 str, ) -> Pin<Box<dyn Future<Output = GraphmindResult<()>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait,

Delete a graph

fn list_graphs<'life0, 'async_trait>( &'life0 self, ) -> Pin<Box<dyn Future<Output = GraphmindResult<Vec<String>>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait,

List all graphs

fn status<'life0, 'life1, 'async_trait>( &'life0 self, _graph: &'life1 str, ) -> Pin<Box<dyn Future<Output = GraphmindResult<ServerStatus>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait,

Get server status for a specific graph

fn ping<'life0, 'async_trait>( &'life0 self, ) -> Pin<Box<dyn Future<Output = GraphmindResult<String>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait,

Ping the server

fn schema<'life0, 'life1, 'async_trait>( &'life0 self, _graph: &'life1 str, ) -> Pin<Box<dyn Future<Output = GraphmindResult<String>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait,

Return a schema summary (node types, edge types, counts)

fn explain<'life0, 'life1, 'life2, 'async_trait>( &'life0 self, _graph: &'life1 str, cypher: &'life2 str, ) -> Pin<Box<dyn Future<Output = GraphmindResult<QueryResult>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait, 'life2: 'async_trait,

Return the EXPLAIN plan for a Cypher query without executing it

fn profile<'life0, 'life1, 'life2, 'async_trait>( &'life0 self, _graph: &'life1 str, cypher: &'life2 str, ) -> Pin<Box<dyn Future<Output = GraphmindResult<QueryResult>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait, 'life2: 'async_trait,

Execute a Cypher query with PROFILE instrumentation

impl VectorClient for EmbeddedClient

fn create_vector_index<'life0, 'life1, 'life2, 'async_trait>( &'life0 self, label: &'life1 str, property: &'life2 str, dimensions: usize, metric: DistanceMetric, ) -> Pin<Box<dyn Future<Output = GraphmindResult<()>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait, 'life2: 'async_trait,

Create a vector index for a given label and property.

fn add_vector<'life0, 'life1, 'life2, 'life3, 'async_trait>( &'life0 self, label: &'life1 str, property: &'life2 str, node_id: NodeId, vector: &'life3 [f32], ) -> Pin<Box<dyn Future<Output = GraphmindResult<()>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait, 'life2: 'async_trait, 'life3: 'async_trait,

Add a vector to the index for a given node.

fn vector_search<'life0, 'life1, 'life2, 'life3, 'async_trait>( &'life0 self, label: &'life1 str, property: &'life2 str, query_vec: &'life3 [f32], k: usize, ) -> Pin<Box<dyn Future<Output = GraphmindResult<Vec<(NodeId, f32)>>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait, 'life2: 'async_trait, 'life3: 'async_trait,

Search for the k nearest neighbors to a query vector.