Struct EdgeAttributedDirectedGraph 

pub struct EdgeAttributedDirectedGraph<Attr: Copy + Clone + Default> { /* private fields */ }

An edge-attributed directed graph.

Implementations

impl<Attr: Copy + Clone + Default> EdgeAttributedDirectedGraph<Attr>

pub fn new(order: usize) -> Self

Initialize an empty graph with order vertices.

pub fn add_edge(&mut self, v: usize, w: usize, attr: Attr)

Add an edge from vertex v to vertex w, with a specified attribute.

pub fn delete_edge(&mut self, v: usize, w: usize)

Remove the edge from vertex v to vertex w.

pub fn has_edge(&self, v: usize, w: usize) -> (bool, Attr)

Check if there is an edge from vertex v to vertex w.

pub fn order(&self) -> usize

Return the number of vertices in the graph.

pub fn neighbors_of(&self, v: usize) -> &Vec<(usize, Attr)>

Return a reference to the adjacency list of vertex v.

pub fn size(&self) -> usize

Return the number of edges in the graph.

pub fn clear(&mut self)

Remove all edges from the graph.

pub fn outdegree(&self, v: usize) -> usize

Return the out-degree of vertex v.

pub fn indegree(&self, v: usize) -> usize

Return the in-degree of vertex v.

Note: This requires O(|V| + |E|) time to compute.

Trait Implementations

impl<Attr: Clone + Copy + Clone + Default> Clone for EdgeAttributedDirectedGraph<Attr>

fn clone(&self) -> EdgeAttributedDirectedGraph<Attr>

Returns a duplicate of the value.

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

Performs copy-assignment from source.