sqlite-graphrag 1.2.7

Persistent GraphRAG memory for Claude Code, Codex, Cursor, and 27 AI agents — one self-contained ~19 MiB Rust binary, zero daemon. Never re-explain your codebase again. Hybrid retrieval (FTS5 BM25 + cosine similarity + multi-hop graph traversal) surfaces the right memory in milliseconds. Embedding and entity enrichment run as parallel REST calls against your cloud LLM — no fragile headless subprocesses, no ONNX runtime, no model downloads. Soft-delete with full version history, transactional atomic writes, BLAKE3-tracked mutations. OAuth-only: raw API keys ABORT the spawn.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24

//! Entity graph traversal (BFS over memory_entities + relations).
//!
//! Queries the SQLite entity and relation tables to expand neighbourhood
//! sets used by the `related`, `recall`, `hybrid-search`, `deep-research` and
//! `graph traverse` commands.
//!
//! `walk` holds the single BFS engine; the other modules are thin adapters.
//! `traverse` answers "which memories are within N hops", `bfs` additionally
//! records the predecessor of each entity so evidence chains can be
//! reconstructed.

mod bfs;
mod traverse;
pub mod walk;

pub use bfs::{bfs_with_predecessors, EntityDepthMap, PredecessorMap};
pub use traverse::{traverse_from_memories_with_hops, traverse_from_memories_with_hops_capped};
pub use walk::{
    EdgeArrival, GraphWalk, InMemoryNeighbors, MemoryEdge, NeighborSource, SqlNeighbors,
    WalkDirection, WalkOutcome,
};

#[cfg(test)]
mod tests;