Struct CsrIndex 

pub struct CsrIndex { /* private fields */ }

flat csr adjacency over chunk ordinals. offsets[node..node+1] bounds node’s run in neighbors (and edge_types), so one node’s neighbors are a contiguous &[u32] slice.

Implementations

impl CsrIndex

pub fn from_bytes( bytes: &[u8], n_embeddings: usize, ) -> Result<Self, RuntimeError>

parse a graph_adjacency csr payload. n_embeddings is the corpus chunk count; the csr’s n_nodes must match it so neighbor ids index the same ordinal space as the embeddings.

pub fn n_nodes(&self) -> usize

pub fn neighbors(&self, node: usize) -> &[u32]

node node’s out-neighbors as a contiguous slice. empty (not an error) for an out-of-range node so the bfs can probe freely.

pub fn edge_type(&self, node: usize, i: usize) -> Option<u8>

edge type of node’s i-th out-edge (0-based within the node’s run).