Struct GraphStore 

pub struct GraphStore { /* private fields */ }

Implementations

impl GraphStore

pub fn new(db_root: &Path) -> Result<Self>

pub fn in_memory() -> Self

Create a pure in-memory graph store — no disk I/O.

pub fn add_edge(&self, from: &str, edge_type: &str, to: &str) -> Result<()>

Add a directed edge: from → to with the given type label.

pub fn outgoing(&self, from: &str, edge_type: &str) -> Vec<String>

Get all outgoing edges of a given type from a node.

pub fn incoming(&self, to: &str, reverse_edge_type: &str) -> Vec<String>

Get all incoming edges of a given type to a node (reverse lookup). This requires scanning the {reverse_edge_type} edges stored when writing.

pub fn trace( &self, start: &str, edge_type: &str, reverse: bool, limit: usize, ) -> Vec<String>

TRACE: walk the DAG from start following edge_type edges. Returns hashes in BFS order, up to limit.