Struct WeightedGraph 

pub struct WeightedGraph<T, W> { /* private fields */ }

Weighted graph representation

Implementations

impl<T: Clone + Eq + Hash, W: Clone + PartialOrd> WeightedGraph<T, W>

pub fn new() -> Self

Create a new empty weighted graph

pub fn add_vertex(&mut self, vertex: T) -> usize

Add a vertex to the graph

pub fn add_edge(&mut self, from: &T, to: &T, weight: W) -> UtilsResult<()>

Add a weighted edge between two vertices

pub fn minimum_spanning_tree(&self) -> UtilsResult<Vec<(usize, usize, W)>>

where W: Clone + PartialOrd + Copy,

Get the minimum spanning tree using Kruskal’s algorithm

pub fn vertices(&self) -> &[T]

Get vertices as a reference

pub fn edges(&self) -> &[Vec<(usize, W)>]

Get edges as a reference

pub fn serialize(&self) -> String

where T: Display, W: Display,

Serialize the weighted graph to a string representation

pub fn visualize(&self) -> String

where T: Display, W: Display,

Visualize the weighted graph structure

pub fn structural_equals(&self, other: &Self) -> bool

where T: PartialEq, W: PartialEq + Eq + Hash,

Compare two weighted graphs for structural equality

Trait Implementations

impl<T: Clone, W: Clone> Clone for WeightedGraph<T, W>

fn clone(&self) -> WeightedGraph<T, W>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug, W: Debug> Debug for WeightedGraph<T, W>

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

Formats the value using the given formatter.

impl<T: Clone + Eq + Hash, W: Clone + PartialOrd> Default for WeightedGraph<T, W>

fn default() -> Self

Returns the “default value” for a type.