Struct Graph 

pub struct Graph<E>
where
    E: EdgeTrait + Debug,
{ /* private fields */ }

Implementations

impl<E> Graph<E>

where E: EdgeTrait + Debug,

pub fn add_edge_or_reduce_weight(&mut self, from: u32, edge: E)

pub fn remove_all_incident_edges(&mut self, from: u32)

pub fn print(&self)

pub fn print_edges(&self)

pub fn print_edge_counts(&self)

Trait Implementations

impl<E> Clone for Graph<E>

where E: EdgeTrait + Debug + Clone,

fn clone(&self) -> Graph<E>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<E> DoubleSidedGraphTrait<E> for Graph<E>

where E: EdgeTrait + Debug,

fn in_degree(&self, vertex: u32) -> u32

fn inbound_neighbours(&self, from: u32) -> Vec<u32>

fn inbound_edge(&self, vertex: u32, i: u32) -> Option<E>

fn inbound_edges(&self, vertex: u32) -> &Vec<E>

impl<E> GraphTrait<E> for Graph<E>

where E: EdgeTrait + Debug,

fn new(vertices: u32) -> Graph<E>

fn new_empty() -> Graph<E>

fn set_num_vertices(&mut self, vertices: u32)

fn add_edge(&mut self, from: u32, edge: E)

fn num_vertices(&self) -> u32

fn num_edges(&self) -> u32

fn out_degree(&self, vertex: u32) -> u32

fn outbound_neighbours(&self, from: u32) -> Vec<u32>

fn outbound_edge(&self, vertex: u32, i: u32) -> Option<E>

fn outbound_edges(&self, vertex: u32) -> &Vec<E>

fn get_outbound_edge_between_vertices( &self, vertex_1: u32, vertex_2: u32, ) -> Option<E>