Struct UndirectedGraph

pub struct UndirectedGraph<V> { /* private fields */ }

An undirected graph with a value on each edge.

Implementations

impl<V: Copy> UndirectedGraph<V>

pub fn new(vertex_count: usize) -> Self

pub fn has_edges(&self, vertex: usize) -> bool

pub fn add_edge(&mut self, vertex_a: usize, vertex_b: usize, value: V) -> bool

Adds an edge between vertex_a and vertex_b with the specified value. Returns true if successful, and false if an edge already existed with a different value.

pub fn pop_edge(&mut self, vertex: usize) -> Option<Edge<V>>

pub fn pop_only_edge(&mut self, vertex: usize) -> Option<Edge<V>>

Returns the edge if it is the only one remaining. A self-reference does not count, so the function returns None.

Trait Implementations

impl<V: Debug> Debug for UndirectedGraph<V>

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

Formats the value using the given formatter.

impl<V: PartialEq> PartialEq for UndirectedGraph<V>

fn eq(&self, other: &UndirectedGraph<V>) -> bool

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

const 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<V> StructuralPartialEq for UndirectedGraph<V>