Struct SimpleGraph 

pub struct SimpleGraph {
    pub vertices: Vec<VertexWithEdges>,
}

undirected, without loops or multiple edges

Fields

vertices: Vec<VertexWithEdges>

Implementations

impl SimpleGraph

pub fn from_graph<G: Graph>(graph: &G) -> Self

pub fn add_vertex_with_index(&mut self, vertex: usize)

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

pub fn first_vertex(&self) -> Option<&VertexWithEdges>

pub fn vertex(&self, index: usize) -> Option<&VertexWithEdges>

pub fn remove_vertex(&mut self, vertex: usize)

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 Display for SimpleGraph

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

Formats the value using the given formatter.

impl Graph for SimpleGraph

type V = VertexWithEdges

type E = UndirectedEdge

fn size(&self) -> usize

fn has_edge(&self, from: usize, to: usize) -> bool

fn add_vertex(&mut self)

fn add_edge(&mut self, from: usize, to: usize)

fn remove_edge(&mut self, from: usize, to: usize)

fn remove_edges_of_vertex(&mut self, vertex: usize)

fn remove_vertex(&mut self, vertex_index: usize)

fn vertices<'a>(&'a self) -> Box<dyn Iterator<Item = &'a VertexWithEdges> + 'a>

fn edges<'a>(&'a self) -> Box<dyn Iterator<Item = &'a UndirectedEdge> + 'a>

fn edges_of_vertex<'a>( &'a self, vertex: usize, ) -> Box<dyn Iterator<Item = &'a UndirectedEdge> + 'a>

fn neighbors_of_vertex(&self, vertex: usize) -> Vec<usize>

impl GraphConstructor for SimpleGraph

fn new() -> Self

fn with_capacity(vertices: usize, _edges: usize) -> Self

fn with_vertices_capacity(vertices: usize) -> Self

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 Eq for SimpleGraph

impl UndirectedGraph for SimpleGraph