Struct AdjacencyList 

pub struct AdjacencyList {
    pub num_vertices: usize,
    pub row_offsets: Vec<usize>,
    pub col_indices: Vec<usize>,
    pub graph_type: GraphType,
}

Sparse adjacency representation of a graph in CSR-like format.

For vertex v, its neighbours are stored in col_indices[row_offsets[v]..row_offsets[v + 1]].

Fields

num_vertices: usize

Number of vertices.

row_offsets: Vec<usize>

Row offset array of length num_vertices + 1.

col_indices: Vec<usize>

Column index array containing neighbour vertex ids.

graph_type: GraphType

Whether the graph is directed or undirected.

Implementations

impl AdjacencyList

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

Returns the degree of vertex v.

Errors

Returns RandError::InvalidSize if v >= num_vertices.

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

Returns the neighbours of vertex v.

Errors

Returns RandError::InvalidSize if v >= num_vertices.

pub fn stats(&self) -> GraphStats

Computes aggregate statistics of the graph.

pub fn to_csr_values<T: Default + Copy>( &self, default_val: T, ) -> (Vec<usize>, Vec<usize>, Vec<T>)

Converts to CSR format with uniform edge weights.

Returns (row_offsets, col_indices, values) where every edge receives the supplied default_val.

Trait Implementations

impl Clone for AdjacencyList

fn clone(&self) -> AdjacencyList

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for AdjacencyList

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

Formats the value using the given formatter.

impl Display for AdjacencyList

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

Formats the value using the given formatter.