Struct GraphCsr 

pub struct GraphCsr {
    pub n: usize,
    pub offsets: Vec<u32>,
    pub targets: Vec<u32>,
    pub weights: Vec<f32>,
}

CSR (compressed-sparse-row) adjacency + per-node weight — the GPU-streamable graph. offsets[i]..offsets[i+1] indexes into targets for node i’s neighbours; weights[i] is node i’s mass. The three Vecs map 1:1 onto the three GPU storage buffers (offsets/targets read-only, weights packed into the node buffer), so this is the upload format — no repack at the seam.

Fields

n: usize

offsets: Vec<u32>

Length n + 1. offsets[i]..offsets[i+1] = node i’s slice of targets.

targets: Vec<u32>

Neighbour node indices (undirected: each input edge contributes both ways).

weights: Vec<f32>

Per-node mass / importance (default 1.0). Streamed from an Arrow weight column.

Implementations

impl GraphCsr

pub fn from_edges( n: usize, edges: &[(u32, u32)], weights: Option<&[f32]>, ) -> Self

Build CSR from a directed edge list (from,to node indices) over n nodes. Layout forces are undirected, so each edge attracts both endpoints (the targets row holds both directions); self-loops + out-of-range ids are dropped, and parallel edges are de-duplicated. weights (per node) default to 1.0 when None or short.

The edges are exactly the (src, dst) pairs an Arrow edge RecordBatch exposes (Int64 columns cast to u32); [GraphCsr::from_arrow] is the zero-glue Arrow front door over this.

pub fn degree_sum(&self) -> usize

The number of undirected adjacency entries (= 2 × distinct edges).

pub fn neighbours(&self, i: usize) -> &[u32]

Node i’s neighbour slice.

Trait Implementations

impl Clone for GraphCsr

fn clone(&self) -> GraphCsr

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for GraphCsr

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

Formats the value using the given formatter.

impl PartialEq for GraphCsr

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl StructuralPartialEq for GraphCsr