Struct SimpleGraph 

pub struct SimpleGraph { /* private fields */ }

A simple unweighted undirected graph.

This is the default graph type for most problems. It wraps petgraph’s UnGraph and implements the Graph trait.

Example

use problemreductions::topology::SimpleGraph;
use problemreductions::topology::Graph;

let graph = SimpleGraph::new(4, vec![(0, 1), (1, 2), (2, 3)]);
assert_eq!(graph.num_vertices(), 4);
assert_eq!(graph.num_edges(), 3);
assert!(graph.has_edge(0, 1));
assert!(!graph.has_edge(0, 2));

Implementations

impl SimpleGraph

pub fn new(num_vertices: usize, edges: Vec<(usize, usize)>) -> Self

Creates a new graph with the given vertices and edges.

Arguments

• num_vertices - Number of vertices in the graph
• edges - List of edges as (u, v) pairs

Panics

Panics if any edge references a vertex index >= num_vertices.

pub fn empty(num_vertices: usize) -> Self

Creates an empty graph with the given number of vertices.

pub fn complete(num_vertices: usize) -> Self

Creates a complete graph (all vertices connected).

pub fn path(num_vertices: usize) -> Self

Creates a path graph (0-1-2-…-n).

pub fn cycle(num_vertices: usize) -> Self

Creates a cycle graph (0-1-2-…-n-0).

pub fn star(num_vertices: usize) -> Self

Creates a star graph (vertex 0 connected to all others).

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

Creates a grid graph with the given dimensions.

Vertices are numbered row by row: vertex r * cols + c is at row r, column c.

Trait Implementations

impl Clone for SimpleGraph

fn clone(&self) -> SimpleGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for SimpleGraph

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for SimpleGraph

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Graph for SimpleGraph

fn num_vertices(&self) -> usize

Returns the number of vertices in the graph.

fn num_edges(&self) -> usize

Returns the number of edges in the graph.

fn edges(&self) -> Vec<(usize, usize)>

Returns all edges as a list of (u, v) pairs.

fn has_edge(&self, u: usize, v: usize) -> bool

Checks if an edge exists between vertices u and v.

fn neighbors(&self, v: usize) -> Vec<usize>

Returns all neighbors of vertex v.

fn degree(&self, v: usize) -> usize

Returns the degree of vertex v (number of neighbors).

fn is_empty(&self) -> bool

Returns true if the graph has no vertices.

fn for_each_edge<F>(&self, f: F)

where F: FnMut(usize, usize),

Iterates over all edges, calling a closure for each.

impl PartialEq for SimpleGraph

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

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Serialize for SimpleGraph

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl Eq for SimpleGraph