Struct CsrEdges 

pub struct CsrEdges { /* private fields */ }

Compressed Sparse Row (CSR) format for edge storage

Replaces Vec per vertex with two arrays:

• offsets: Start index for each vertex’s edges
• edges: All edges concatenated

Memory usage: O(V + E) instead of O(V * avg_degree * vec_overhead)

Implementations

impl CsrEdges

pub fn from_adjacency(adj: Vec<(u32, Vec<u32>)>, coords: &[PackedCoord]) -> Self

Create CSR from adjacency list representation

Arguments

• adj: Vector of (vertex_id, outgoing_edges) where vertex_id is the actual VertexId value
• coords: Packed coordinates for each vertex (used for deterministic ordering)

Edge Ordering

Edges are sorted by (row, col, vertex_id) to ensure deterministic evaluation order for formulas (important for functions with side effects)

pub fn out_edges(&self, v: VertexId) -> &[VertexId]

Get outgoing edges for a vertex

pub fn in_edges(&self, v: VertexId) -> &[VertexId]

Get incoming edges for a vertex (who depends on this vertex)

pub fn out_degree(&self, v: VertexId) -> usize

Get the out-degree of a vertex

pub fn in_degree(&self, v: VertexId) -> usize

Get the in-degree of a vertex

pub fn num_vertices(&self) -> usize

Number of vertices in the graph

pub fn num_edges(&self) -> usize

Total number of edges in the graph

pub fn memory_usage(&self) -> usize

Memory usage in bytes

pub fn empty() -> Self

Create an empty CSR graph

pub fn builder() -> CsrBuilder

Builder pattern for incremental construction

pub fn iter(&self) -> CsrIterator<'_>

Iterate over all vertices and their outgoing edges

pub fn has_edge(&self, from: VertexId, to: VertexId) -> bool

Check if the graph has a specific edge

Trait Implementations

impl Clone for CsrEdges

fn clone(&self) -> CsrEdges

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for CsrEdges

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

Formats the value using the given formatter.