Struct GraphView 

pub struct GraphView {
    pub node_count: usize,
    pub index_to_node: Vec<NodeId>,
    pub node_to_index: HashMap<NodeId, usize>,
    pub out_offsets: Vec<usize>,
    pub out_targets: Vec<usize>,
    pub in_offsets: Vec<usize>,
    pub in_sources: Vec<usize>,
    pub weights: Option<Vec<f64>>,
}

A dense, integer-indexed view of the graph topology using Compressed Sparse Row (CSR) format.

Fields

node_count: usize

Number of nodes

index_to_node: Vec<NodeId>

Mapping from dense index (0..N) back to NodeId

node_to_index: HashMap<NodeId, usize>

Mapping from NodeId to dense index

out_offsets: Vec<usize>

Outgoing edges CSR structure Offsets into out_targets. Size = node_count + 1

out_targets: Vec<usize>

Contiguous array of target node indices

in_offsets: Vec<usize>

Incoming edges CSR structure (Compressed Sparse Column effectively) Offsets into in_sources. Size = node_count + 1

in_sources: Vec<usize>

Contiguous array of source node indices

weights: Option<Vec<f64>>

Edge weights: aligned with out_targets

Implementations

impl GraphView

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

Get the out-degree of a node (by index)

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

Get the in-degree of a node (by index)

pub fn successors(&self, idx: usize) -> &[usize]

Get outgoing neighbors (successors) of a node

pub fn predecessors(&self, idx: usize) -> &[usize]

Get incoming neighbors (predecessors) of a node

pub fn weights(&self, idx: usize) -> Option<&[f64]>

Get weights for outgoing edges of a node

pub fn from_adjacency_list( node_count: usize, index_to_node: Vec<NodeId>, node_to_index: HashMap<NodeId, usize>, outgoing: Vec<Vec<usize>>, incoming: Vec<Vec<usize>>, weights: Option<Vec<Vec<f64>>>, ) -> Self

Helper to create GraphView from adjacency lists (legacy/test support)