Struct Graph 

pub struct Graph { /* private fields */ }

A weighted undirected graph over nodes 0..n. Parallel edges are summed; self-loops are kept (they affect modularity but not community moves).

Implementations

impl Graph

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

Build from undirected weighted edges. (u, v, w) and (v, u, w) are equivalent; parallel edges accumulate.

pub fn node_count(&self) -> usize

pub fn total_weight(&self) -> f64

pub fn modularity(&self, comm: &[usize]) -> f64

Newman modularity of a partition (community id per node).

pub fn quotient(&self, comm: &[usize], k: usize) -> Graph

Coarsen the graph: each community becomes one node. Returns the quotient graph and the dense community count. comm must use dense IDs 0..k.

Trait Implementations

impl Clone for Graph

fn clone(&self) -> Graph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Graph

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

Formats the value using the given formatter.