Struct Graph 

pub struct Graph {
    pub num_vertices: usize,
    pub edges: Vec<(usize, usize, f64)>,
}

A simple graph representation for optimization problems.

Fields

num_vertices: usize

Number of vertices

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

Edges as (u, v, weight) tuples

Implementations

impl Graph

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

Create a graph from unweighted edges.

pub fn from_weighted_edges(edges: &[(usize, usize, f64)]) -> Self

Create a graph from weighted edges.

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

Formats the value using the given formatter.