Struct Adjacency 

pub struct Adjacency {
    pub n: usize,
    pub out: Vec<Vec<(usize, f32)>>,
    pub inc: Vec<Vec<(usize, f32)>>,
    pub und: Vec<Vec<(usize, f32)>>,
}

A built adjacency over n indexed nodes: directed out / in neighbour lists plus an undirected view, each carrying an edge weight (1.0 for unweighted input). Built once from (n, edges) and shared by the analysis algorithms.

Fields

n: usize

Node count (indices 0..n).

out: Vec<Vec<(usize, f32)>>

out[i] = directed out-neighbours of i as (j, weight).

inc: Vec<Vec<(usize, f32)>>

inc[i] = directed in-neighbours of i as (j, weight).

und: Vec<Vec<(usize, f32)>>

und[i] = undirected neighbours of i as (j, weight) (each edge both ways).

Implementations

impl Adjacency

pub fn from_edges(n: usize, edges: &[(usize, usize)]) -> Self

Build from unweighted directed edges (each (a, b) has weight 1.0). Out-of-range endpoints and self-loops are dropped.

pub fn from_weighted(n: usize, edges: &[(usize, usize, f32)]) -> Self

Build from weighted directed edges. Out-of-range endpoints and self-loops are dropped; parallel edges accumulate their weight.

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

Out-degree of i (count of distinct out-neighbours).

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

In-degree of i.

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

Undirected degree of i.

Trait Implementations

impl Clone for Adjacency

fn clone(&self) -> Adjacency

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Adjacency

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

Formats the value using the given formatter.