Struct AdjListGraph 

pub struct AdjListGraph { /* private fields */ }

Generic symmetric adjacency-list graph. Useful as a target when adapting an edge-list representation (e.g. GenePairGraph) to algorithms that consume WeightedGraph.

Implementations

impl AdjListGraph

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

Build from a canonical (u ≤ v) edge list. Each edge is expanded to both directions internally; self-loops are dropped.

pub fn from_unweighted_edges(n_nodes: usize, edges: &[(usize, usize)]) -> Self

Build from unweighted canonical edges; each edge gets weight 1.0.

Trait Implementations

impl WeightedGraph for AdjListGraph

fn num_nodes(&self) -> usize

fn num_edges(&self) -> usize

fn neighbors_with_weight<'a>( &'a self, node: usize, ) -> Box<dyn Iterator<Item = (usize, f32)> + 'a>

fn degree(&self, node: usize) -> usize

fn weighted_degree(&self, node: usize) -> f32