Struct Graph 

pub struct Graph { /* private fields */ }

Top-level graph handle: memtable over immutable segments, LSM-style.

Reads merge the memtable with every open segment; flush drains the memtable into a new segment and commits a new manifest generation. Graph::new is in-memory only (no flush); Graph::open is the embedded persistent mode.

Implementations

impl Graph

pub fn new() -> Self

In-memory only; flush returns Error::NoStore.

pub fn open(dir: impl AsRef<Path>) -> Result<Self>

Open (or create) a graph rooted at dir.

pub fn upsert_node(&mut self, key: &str) -> NodeId

Create a node with a user-facing key, or return the existing id.

pub fn node(&self, key: &str) -> Option<NodeId>

pub fn label(&mut self, name: &str) -> EdgeLabel

Intern a label string, returning its id. Label indices are identity forever — the manifest’s label list is append-only.

pub fn add_edge( &mut self, src: NodeId, label: EdgeLabel, dst: NodeId, ) -> Result<()>

pub fn out(&self, src: NodeId, label: EdgeLabel) -> impl Iterator<Item = NodeId>

Outbound neighbors of src under label, merged across memtable and segments, ascending and deduplicated.

pub fn in(&self, dst: NodeId, label: EdgeLabel) -> impl Iterator<Item = NodeId>

Inbound neighbors of dst under label, merged the same way.

pub fn flush(&mut self) -> Result<u64>

Drain the memtable into a new segment and commit the next manifest generation. No-op (returns the current generation) when there is nothing to write.

pub fn generation(&self) -> u64

pub fn node_count(&self) -> u64

pub fn edge_count(&self) -> u64

Trait Implementations

impl Default for Graph

fn default() -> Self

Returns the “default value” for a type.