Struct CsrIndex 

pub struct CsrIndex {
    pub offsets: Vec<u64>,
    pub edge_ids: Vec<u64>,
    pub neighbor_ids: Vec<u64>,
}

In-memory CSR adjacency structure, surrogate-keyed.

Neighbors of node_id = i are (edge_ids[j], neighbor_ids[j]) for j in offsets[i]..offsets[i + 1].

Invariants (enforced on read and write)

• offsets is non-empty and offsets[0] == 0 — the empty graph is offsets == [0] with empty targets, never an empty offsets.
• offsets is monotonically non-decreasing; a node with no neighbors is an empty range.
• *offsets.last() == edge_ids.len() == neighbor_ids.len().

Fields

offsets: Vec<u64>

CSR offsets, length node_count + 1.

edge_ids: Vec<u64>

Edge surrogate per adjacency entry, in CSR order.

neighbor_ids: Vec<u64>

Neighbor node surrogate per adjacency entry, in CSR order.

Implementations

impl CsrIndex

pub fn node_count(&self) -> u64

Number of source nodes covered (CSR row count).

pub fn edge_count(&self) -> u64

Number of (edge, neighbor) adjacency entries.

Trait Implementations

impl Clone for CsrIndex

fn clone(&self) -> CsrIndex

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for CsrIndex

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for CsrIndex

fn default() -> CsrIndex

Returns the “default value” for a type.

impl Eq for CsrIndex

impl PartialEq for CsrIndex

fn eq(&self, other: &CsrIndex) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for CsrIndex