Struct Graph 

pub struct Graph {
    pub num_vertices: usize,
    pub edges: HashMap<usize, HashSet<usize>>,
}

Graph structure for graph states

Fields

num_vertices: usize

Number of vertices

edges: HashMap<usize, HashSet<usize>>

Adjacency list representation

Implementations

impl Graph

pub fn new(num_vertices: usize) -> Self

Create a new empty graph

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

Add an edge between two vertices

pub fn neighbors(&self, v: usize) -> Option<&HashSet<usize>>

Get neighbors of a vertex

pub fn linear_cluster(n: usize) -> Self

Create a linear cluster (1D chain)

pub fn rectangular_cluster(rows: usize, cols: usize) -> Self

Create a 2D rectangular cluster

pub fn complete(n: usize) -> Self

Create a complete graph

pub fn star(n: usize) -> Self

Create a star graph (one central node connected to all others)

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.