Struct GraphStorage 

pub struct GraphStorage { /* private fields */ }

Storage backend for graph database

Implementations

impl GraphStorage

pub fn new<P: AsRef<Path>>(path: P) -> Result<Self>

Create or open a graph storage at the given path

Uses a global connection pool to allow multiple GraphStorage instances to share the same underlying database file

pub fn insert_node(&self, node: &Node) -> Result<NodeId>

Insert a node

pub fn insert_nodes_batch(&self, nodes: &[Node]) -> Result<Vec<NodeId>>

Insert multiple nodes in a batch

pub fn get_node(&self, id: &str) -> Result<Option<Node>>

Get a node by ID

pub fn delete_node(&self, id: &str) -> Result<bool>

Delete a node by ID

pub fn all_node_ids(&self) -> Result<Vec<NodeId>>

Get all node IDs

pub fn insert_edge(&self, edge: &Edge) -> Result<EdgeId>

Insert an edge

pub fn insert_edges_batch(&self, edges: &[Edge]) -> Result<Vec<EdgeId>>

Insert multiple edges in a batch

pub fn get_edge(&self, id: &str) -> Result<Option<Edge>>

Get an edge by ID

pub fn delete_edge(&self, id: &str) -> Result<bool>

Delete an edge by ID

pub fn all_edge_ids(&self) -> Result<Vec<EdgeId>>

Get all edge IDs

pub fn insert_hyperedge(&self, hyperedge: &Hyperedge) -> Result<HyperedgeId>

Insert a hyperedge

pub fn insert_hyperedges_batch( &self, hyperedges: &[Hyperedge], ) -> Result<Vec<HyperedgeId>>

Insert multiple hyperedges in a batch

pub fn get_hyperedge(&self, id: &str) -> Result<Option<Hyperedge>>

Get a hyperedge by ID

pub fn delete_hyperedge(&self, id: &str) -> Result<bool>

Delete a hyperedge by ID

pub fn all_hyperedge_ids(&self) -> Result<Vec<HyperedgeId>>

Get all hyperedge IDs

pub fn set_metadata(&self, key: &str, value: &str) -> Result<()>

Set metadata

pub fn get_metadata(&self, key: &str) -> Result<Option<String>>

Get metadata

pub fn node_count(&self) -> Result<usize>

Get the number of nodes

pub fn edge_count(&self) -> Result<usize>

Get the number of edges

pub fn hyperedge_count(&self) -> Result<usize>

Get the number of hyperedges