Struct GraphTableRead 

pub struct GraphTableRead { /* private fields */ }

Read-only graph table providing efficient edge traversal with temporal support.

Implementations

impl GraphTableRead

pub fn open(txn: &ReadTransaction, name: &str) -> Result<Self, StorageError>

Opens a graph table for reading.

pub fn get_edge( &self, source: &Uuid, edge_type: &str, target: &Uuid, ) -> Result<Option<Edge>, StorageError>

Retrieves a specific edge by source, edge_type, and target.

Returns None if the edge doesn’t exist or has been soft-deleted. Use get_edge_at() for temporal queries.

pub fn get_edge_at( &self, source: &Uuid, edge_type: &str, target: &Uuid, timestamp: u64, ) -> Result<Option<Edge>, StorageError>

Retrieves a specific edge at a given timestamp.

Returns the edge if it existed at the specified timestamp (created_at <= timestamp and either not deleted or deleted_at > timestamp).

pub fn outgoing_edges( &self, source: &Uuid, ) -> Result<OutgoingEdgeIter<'_>, StorageError>

Returns an iterator over all outgoing edges from the given source vertex.

By default, excludes soft-deleted edges. Use outgoing_edges_with_deleted() to include them.

pub fn outgoing_edges_with_deleted( &self, source: &Uuid, ) -> Result<OutgoingEdgeIter<'_>, StorageError>

Returns an iterator over all outgoing edges including soft-deleted ones.

pub fn incoming_edges( &self, target: &Uuid, ) -> Result<IncomingEdgeIter<'_>, StorageError>

Returns an iterator over all incoming edges to the given target vertex.

By default, excludes soft-deleted edges. Use incoming_edges_with_deleted() to include them.

pub fn incoming_edges_with_deleted( &self, target: &Uuid, ) -> Result<IncomingEdgeIter<'_>, StorageError>

Returns an iterator over all incoming edges including soft-deleted ones.

pub fn all_edges(&self) -> Result<AllEdgesIter<'_>, StorageError>

Returns an iterator over all edges in the graph.

By default, excludes soft-deleted edges. Use all_edges_with_deleted() to include them.

pub fn all_edges_with_deleted(&self) -> Result<AllEdgesIter<'_>, StorageError>

Returns an iterator over all edges including soft-deleted ones.

pub fn len(&self) -> Result<u64, StorageError>

Returns the number of edges stored in this table.

pub fn is_empty(&self) -> Result<bool, StorageError>

Returns true if the table contains no edges.

Trait Implementations

impl EdgeSource for GraphTableRead

type Iter<'a> = AllEdgesIter<'a> where Self: 'a

Iterator type over edges

fn all_edges(&self) -> Result<Self::Iter<'_>, StorageError>

Returns an iterator over all edges in the graph.

fn edge_count(&self) -> Result<u64, StorageError>

Returns the number of edges.

fn is_empty(&self) -> Result<bool, StorageError>

Returns true if empty.