Struct CompressedSparseRow 

pub struct CompressedSparseRow { /* private fields */ }

Compressed Sparse Row (CSR) representation of adjacency

Optimized for:

1. Low memory footprint (offsets are u32)
2. O(1) neighbor lookup using DenseIdx
3. CPU cache locality (contiguous memory)

Note: CSR uses DenseIdx internally. Use VidRemapper to convert Vid ↔ DenseIdx.

Implementations

impl CompressedSparseRow

pub fn from_edges( entries: Vec<(Vid, Vid, Eid)>, remapper: &mut VidRemapper, ) -> Self

Creates a new CSR from a list of edges.

Arguments

• entries - List of (src_vid, dst_vid, eid) tuples
• remapper - Mutable remapper that will be populated with all VIDs

Returns the CSR with all vertices remapped to dense indices.

pub fn new(max_vid_offset: usize, entries: Vec<(u64, Vid, Eid)>) -> Self

Creates a CSR from pre-sorted edges with src as u64 offset.

Entries are (src_offset, neighbor_vid, eid).

pub fn get_neighbors_dense( &self, idx: DenseIdx, ) -> (&[DenseIdx], &[Vid], &[Eid])

O(1) neighbor lookup using DenseIdx.

Returns slices of (neighbor dense indices, neighbor VIDs, edge IDs).

pub fn get_neighbors(&self, vid: Vid) -> (&[Vid], &[Eid])

O(1) neighbor lookup using Vid directly.

Looks up using VID’s raw value as offset. Returns slices of (neighbor VIDs, edge IDs).

pub fn memory_usage(&self) -> usize

Approximate memory usage in bytes.

pub fn num_vertices(&self) -> usize

Returns the number of vertices (rows) in the CSR.

pub fn num_edges(&self) -> usize

Returns the number of edges in the CSR.

pub fn iter_all(&self) -> impl Iterator<Item = (u64, Vid, Eid)> + '_

Iterate over all edges in the CSR. Returns iterator over (src_offset, dst_vid, eid).

Trait Implementations

impl Clone for CompressedSparseRow

fn clone(&self) -> CompressedSparseRow

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.