Struct WeightedGraph 

pub struct WeightedGraph {
    pub n: usize,
    pub edges: Vec<Vec<(usize, f64)>>,
}

Weighted graph stored as adjacency list of (neighbor, weight) pairs.

Fields

n: usize

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

Implementations

impl WeightedGraph

pub fn new(n: usize) -> Self

pub fn add_edge(&mut self, u: usize, v: usize, w: f64) -> GraphalgResult<()>

pub fn add_undirected_edge( &mut self, u: usize, v: usize, w: f64, ) -> GraphalgResult<()>

pub fn num_edges(&self) -> usize

pub fn neighbors(&self, u: usize) -> GraphalgResult<&[(usize, f64)]>

pub fn all_edges(&self) -> Vec<(usize, usize, f64)>

Iterate over all directed edges as (u, v, w).

pub fn reverse(&self) -> Self

Reverse the directed weighted graph.

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.