Struct MobileGraphStore 

pub struct MobileGraphStore { /* private fields */ }

In-memory graph store for mobile knowledge graphs.

Implementations

impl MobileGraphStore

pub fn new() -> Arc<Self>

Creates a new empty graph store.

pub fn add_node(&self, node: MobileGraphNode)

Adds a node to the graph.

pub fn add_edge(&self, edge: MobileGraphEdge) -> Result<(), VelesError>

Adds an edge to the graph.

Lock Order

Acquires locks in consistent order: edges → outgoing → incoming WITHOUT dropping between operations to ensure atomicity. This prevents race conditions with concurrent remove_node() calls.

pub fn get_node(&self, id: u64) -> Option<MobileGraphNode>

Gets a node by ID.

pub fn get_edge(&self, id: u64) -> Option<MobileGraphEdge>

Gets an edge by ID.

pub fn node_count(&self) -> u64

Returns the number of nodes.

pub fn edge_count(&self) -> u64

Returns the number of edges.

pub fn get_outgoing(&self, node_id: u64) -> Vec<MobileGraphEdge>

Gets outgoing edges from a node.

Lock Order

Acquires locks in consistent order: edges → outgoing to prevent ABBA deadlock with write operations.

pub fn get_incoming(&self, node_id: u64) -> Vec<MobileGraphEdge>

Gets incoming edges to a node.

Lock Order

Acquires locks in consistent order: edges → incoming to prevent ABBA deadlock with write operations.

pub fn get_outgoing_by_label( &self, node_id: u64, label: String, ) -> Vec<MobileGraphEdge>

Gets outgoing edges filtered by label.

pub fn get_neighbors(&self, node_id: u64) -> Vec<u64>

Gets neighbors reachable from a node (1-hop).

pub fn bfs_traverse( &self, source_id: u64, max_depth: u32, limit: u32, ) -> Vec<TraversalResult>

Performs BFS traversal from a source node.

Arguments

• source_id - Starting node ID
• max_depth - Maximum traversal depth
• limit - Maximum number of results

pub fn remove_node(&self, node_id: u64)

Removes a node and all connected edges.

Lock Order

Acquires locks in consistent order: edges → outgoing → incoming → nodes to prevent deadlock with concurrent add_edge() calls.

pub fn remove_edge(&self, edge_id: u64)

Removes an edge by ID.

Lock Order

Acquires locks in consistent order: edges → outgoing → incoming WITHOUT dropping between operations to ensure atomicity.

pub fn clear(&self)

Clears all nodes and edges.

Lock Order

Acquires locks in consistent order: edges → outgoing → incoming → nodes

pub fn dfs_traverse( &self, source_id: u64, max_depth: u32, limit: u32, ) -> Vec<TraversalResult>

Performs DFS traversal from a source node.

Arguments

• source_id - Starting node ID
• max_depth - Maximum traversal depth
• limit - Maximum number of results

pub fn has_node(&self, id: u64) -> bool

Checks if a node exists.

pub fn has_edge(&self, id: u64) -> bool

Checks if an edge exists.

pub fn out_degree(&self, node_id: u64) -> u32

Gets the out-degree (number of outgoing edges) of a node.

pub fn in_degree(&self, node_id: u64) -> u32

Gets the in-degree (number of incoming edges) of a node.

pub fn get_nodes_by_label(&self, label: String) -> Vec<MobileGraphNode>

Gets all nodes with a specific label.

pub fn get_edges_by_label(&self, label: String) -> Vec<MobileGraphEdge>

Gets all edges with a specific label.

Trait Implementations

impl Default for MobileGraphStore

fn default() -> Self

Returns the “default value” for a type.

impl<UT> LiftRef<UT> for MobileGraphStore

type LiftType = Arc<MobileGraphStore>

impl<UT> LowerError<UT> for MobileGraphStore

fn lower_error(obj: Self) -> RustBuffer

Lower this value for scaffolding function return

impl<UT> LowerReturn<UT> for MobileGraphStore

type ReturnType = <Arc<MobileGraphStore> as LowerReturn<UniFfiTag>>::ReturnType

The type that should be returned by scaffolding functions for this type.

fn lower_return(obj: Self) -> Result<Self::ReturnType, RustCallError>

Lower the return value from an scaffolding call

fn handle_failed_lift( error: LiftArgsError, ) -> Result<Self::ReturnType, RustCallError>

Lower the return value for failed argument lifts

impl<UT> TypeId<UT> for MobileGraphStore

const TYPE_ID_META: MetadataBuffer