Struct NetworkGraph 

pub struct NetworkGraph {
    pub n: usize,
    pub directed: bool,
    pub adj: Vec<Vec<(usize, f64)>>,
}

Adjacency-list graph for network dynamics simulations.

Supports directed and undirected graphs with optional edge weights. Node indices are in 0..n.

Fields

n: usize

Number of nodes.

directed: bool

Whether the graph is directed.

adj: Vec<Vec<(usize, f64)>>

Adjacency list: adj[i] = list of (neighbor, weight).

Implementations

impl NetworkGraph

pub fn new(n: usize, directed: bool) -> Self

Creates an empty graph with n nodes.

pub fn add_edge(&mut self, u: usize, v: usize, w: f64)

Adds a directed edge u → v with weight w.

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

Returns the degree (out-degree for directed) of node u.

pub fn edge_count(&self) -> usize

Returns the number of edges (undirected counts each once).

pub fn complete(n: usize) -> Self

Builds a complete undirected graph (all edges weight 1).

pub fn ring(n: usize) -> Self

Builds a ring graph of n nodes.

pub fn erdos_renyi(n: usize, p: f64, seed: u64) -> Self

Builds an Erdős-Rényi random graph G(n, p) with given seed.

pub fn bfs_distances(&self, s: usize) -> Vec<i64>

Returns BFS distances from source node s (-1 means unreachable).

pub fn average_path_length(&self) -> f64

Average shortest path length (only reachable pairs).

pub fn clustering_coefficient(&self, u: usize) -> f64

Local clustering coefficient for node u.

pub fn mean_clustering(&self) -> f64

Mean clustering coefficient over all nodes.

Trait Implementations

impl Clone for NetworkGraph

fn clone(&self) -> NetworkGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.