Struct CsrIndex 

pub struct CsrIndex { /* private fields */ }

Dense integer CSR adjacency index.

Implementations

impl CsrIndex

pub fn new() -> Self

pub fn add_edge(&mut self, src: &str, label: &str, dst: &str)

Add an edge (goes into mutable buffer). Deduplicates.

pub fn remove_edge(&mut self, src: &str, label: &str, dst: &str)

Remove an edge.

pub fn neighbors( &self, node: &str, label_filter: Option<&str>, direction: Direction, ) -> Vec<(String, String)>

Get immediate neighbors.

pub fn neighbors_multi( &self, node: &str, label_filters: &[&str], direction: Direction, ) -> Vec<(String, String)>

Get neighbors with multi-label filter. Empty labels = all edges.

pub fn node_count(&self) -> usize

pub fn contains_node(&self, node: &str) -> bool

pub fn edge_count(&self) -> usize

Total edge count (dense + buffer - deleted).

pub fn estimated_memory_bytes(&self) -> usize

Estimated memory usage in bytes.

impl CsrIndex

pub fn compact(&mut self)

Merge the mutable buffer into dense CSR arrays.

pub fn checkpoint_to_bytes(&self) -> Vec<u8>

Serialize the index to MessagePack bytes for storage.

pub fn from_checkpoint(bytes: &[u8]) -> Option<Self>

Restore an index from a checkpoint snapshot.

impl CsrIndex

pub fn traverse_bfs( &self, start_nodes: &[&str], label_filter: Option<&str>, direction: Direction, max_depth: usize, max_visited: usize, ) -> Vec<String>

BFS traversal. Returns all reachable node IDs within max_depth hops.

max_visited caps the number of nodes visited to prevent supernode fan-out explosion. Pass DEFAULT_MAX_VISITED for the standard limit.

pub fn traverse_bfs_with_depth( &self, start_nodes: &[&str], label_filter: Option<&str>, direction: Direction, max_depth: usize, max_visited: usize, ) -> Vec<(String, u8)>

BFS traversal returning nodes with depth information.

max_visited caps the number of nodes visited to prevent supernode fan-out explosion. Pass DEFAULT_MAX_VISITED for the standard limit.

pub fn traverse_bfs_with_depth_multi( &self, start_nodes: &[&str], label_filters: &[&str], direction: Direction, max_depth: usize, max_visited: usize, ) -> Vec<(String, u8)>

BFS traversal with multi-label filter. Empty labels = all edges.

max_visited caps the number of nodes visited to prevent supernode fan-out explosion. Pass DEFAULT_MAX_VISITED for the standard limit.

pub fn shortest_path( &self, src: &str, dst: &str, label_filter: Option<&str>, max_depth: usize, max_visited: usize, ) -> Option<Vec<String>>

Shortest path via bidirectional BFS.

max_visited caps the combined forward+backward visited set to prevent supernode fan-out explosion. Pass DEFAULT_MAX_VISITED for the standard limit.

pub fn subgraph( &self, start_nodes: &[&str], label_filter: Option<&str>, max_depth: usize, max_visited: usize, ) -> Vec<(String, String, String)>

Materialize a subgraph as edge tuples within max_depth.

max_visited caps the number of nodes visited to prevent supernode fan-out explosion. Pass DEFAULT_MAX_VISITED for the standard limit.

Trait Implementations

impl Default for CsrIndex

fn default() -> Self

Returns the “default value” for a type.