Struct rust_graph::graph::AdjListGraph

pub struct AdjListGraph<V = (), E = ()> { /* fields omitted */ }

Methods

impl<V: Clone, E: Clone + Ord> AdjListGraph<V, E>

pub fn new(is_directed: bool) -> AdjListGraph<V, E>

pub fn size(&self) -> usize

pub fn num_edges(&self) -> usize

pub fn is_directed(&self) -> bool

pub fn add_node(&mut self, n: usize)

pub fn add_node_with_prop(&mut self, n: usize, v: V)

pub fn add_nodes(&mut self, vertices: Vec<usize>)

pub fn add_nodes_with_prop(&mut self, vertices: Vec<(usize, V)>)

pub fn contains_node(&self, node: usize) -> bool

pub fn copy_node_to(&self, other: &mut AdjListGraph<V, E>, v: usize)

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

pub fn add_edge_with_prop(&mut self, from: usize, to: usize, e: E)

pub fn add_edges(&mut self, edges: Vec<(usize, usize)>)

pub fn add_edges_with_prop(&mut self, edges: Vec<(usize, usize, E)>)

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

pub fn copy_edge_to(
    &self,
    other: &mut AdjListGraph<V, E>,
    from: usize,
    to: usize
)

pub fn node_prop(&self, node: usize) -> Option<V>

pub fn edge_prop(&self, from: usize, to: usize) -> Option<E>

pub fn nodes_iter<'a>(&'a self) -> Keys<'a, usize, Option<V>>

pub fn edges_iter<'a>(&'a self) -> Keys<'a, (usize, usize), Option<E>>

pub fn adj_iter<'a>(&'a self, from: usize) -> Iter<'a, usize>

Trait Implementations

impl<V: Clone + PartialEq, E: Clone + PartialEq + Ord> PartialEq for AdjListGraph<V, E>

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

This method tests for self and other values to be equal, and is used by ==.

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

This method tests for !=.

impl<V: Clone + Eq, E: Clone + Eq + Ord> Eq for AdjListGraph<V, E>

impl<V: Clone, E: Clone + Ord + Debug> Debug for AdjListGraph<V, E>

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

Formats the value using the given formatter.