Struct TransactionGraphAccessor 

pub struct TransactionGraphAccessor<T> { /* private fields */ }

A concrete implementation of GraphAccessor backed by a storage transaction.

This wraps a transaction reference and delegates to the actual graph traversal code.

Implementations

impl<T> TransactionGraphAccessor<T>

pub fn new(tx: T) -> Self

Create a new accessor wrapping a transaction.

Trait Implementations

impl<T> GraphAccessor for TransactionGraphAccessor<T>

where T: Transaction + Send + Sync,

fn neighbors( &self, node: EntityId, direction: Direction, ) -> GraphAccessResult<Vec<NeighborResult>>

Get neighbors of a node in the specified direction.

fn neighbors_by_type( &self, node: EntityId, direction: Direction, edge_type: &EdgeType, ) -> GraphAccessResult<Vec<NeighborResult>>

Get neighbors filtered by edge type.

fn neighbors_by_types( &self, node: EntityId, direction: Direction, edge_types: &[EdgeType], ) -> GraphAccessResult<Vec<NeighborResult>>

Get neighbors filtered by multiple edge types.

fn expand_all( &self, node: EntityId, direction: Direction, min_depth: usize, max_depth: Option<usize>, edge_types: Option<&[EdgeType]>, ) -> GraphAccessResult<Vec<TraversalResult>>

Perform multi-hop expansion from a node.

fn find_paths( &self, start: EntityId, config: &PathFindConfig, ) -> GraphAccessResult<Vec<PathMatchResult>>

Find paths matching a pattern from a starting node.