Struct WeightedGraph 

pub struct WeightedGraph { /* private fields */ }

Undirected weighted graph with self-loop weights.

adj holds each edge in both directions and never contains self entries; self-loop weight (internal edges after aggregation) lives separately in loops.

Implementations

impl WeightedGraph

pub fn new(n: usize) -> Self

Creates an empty graph with n isolated nodes.

pub fn node_count(&self) -> usize

Number of nodes.

pub fn from_edges( n: usize, edges: impl IntoIterator<Item = (usize, usize, f64)>, ) -> Self

Builds a graph from (u, v, weight) undirected edges, aggregating parallel edges. Edges with non-finite or non-positive weight and edges referencing unknown nodes are ignored. A self edge contributes to the node’s self-loop weight.

Trait Implementations

impl Clone for WeightedGraph

fn clone(&self) -> WeightedGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for WeightedGraph

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

Formats the value using the given formatter.