Struct Graph 

pub struct Graph {
    pub num_nodes: u32,
    pub edges: Vec<(u32, u32, f64)>,
}

Simple undirected weighted graph for MaxCut problems.

Fields

num_nodes: u32

Number of vertices (each mapped to one qubit).

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

Edges as (node_i, node_j, weight) triples. Both directions are represented by a single entry (undirected).

Implementations

impl Graph

pub fn new(num_nodes: u32) -> Self

Create an empty graph with the given number of nodes.

pub fn add_edge(&mut self, i: u32, j: u32, weight: f64)

Add an undirected weighted edge between nodes i and j.

Panics

Panics if i or j is out of range.

pub fn unweighted(num_nodes: u32, edges: Vec<(u32, u32)>) -> Self

Convenience constructor for an unweighted graph (all weights = 1.0).

pub fn num_edges(&self) -> usize

Return the total number of 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.