Struct AdjacencyGraph 

pub struct AdjacencyGraph {
    pub num_vertices: usize,
    pub adj_ptr: Vec<usize>,
    pub adj_list: Vec<usize>,
}

Undirected graph of a symmetric sparse matrix in CSR-like form.

Self-loops (diagonal entries) are excluded. Each edge (i,j) appears in both neighbors(i) and neighbors(j).

Fields

num_vertices: usize

Number of vertices.

adj_ptr: Vec<usize>

CSR-style pointers into adj_list. Length = num_vertices + 1.

adj_list: Vec<usize>

Concatenated adjacency lists for all vertices.

Implementations

impl AdjacencyGraph

pub fn from_symmetric_csr( row_ptr: &[i32], col_indices: &[i32], n: usize, ) -> Self

Build an adjacency graph from a symmetric CSR matrix.

Diagonal entries are excluded. The CSR uses i32 indices (matching cuSPARSE convention). Both upper and lower triangular parts should be present for a symmetric matrix.

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

Degree of vertex v.

pub fn neighbors(&self, v: usize) -> &[usize]

Neighbors of vertex v.

Trait Implementations

impl Clone for AdjacencyGraph

fn clone(&self) -> AdjacencyGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for AdjacencyGraph

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

Formats the value using the given formatter.