Trait Graph 

pub trait Graph<'a, N: 'a, E> {
    type NodeIterator: Iterator<Item = &'a N>;
    type NeighborIterator: Iterator<Item = &'a N>;
    type EdgeIterator: Iterator<Item = (&'a N, &'a N)>;

    // Required methods
    fn order(&self) -> usize;
    fn size(&self) -> usize;
    fn nodes(&'a self) -> Self::NodeIterator;
    fn has_node(&self, node: &N) -> bool;
    fn neighbors(&'a self, node: &N) -> Result<Self::NeighborIterator, E>;
    fn degree(&self, node: &N) -> Result<usize, E>;
    fn edges(&'a self) -> Self::EdgeIterator;
    fn has_edge(&self, source: &N, target: &N) -> Result<bool, E>;

    // Provided method
    fn is_empty(&self) -> bool { ... }
}

Required Associated Types

type NodeIterator: Iterator<Item = &'a N>

type NeighborIterator: Iterator<Item = &'a N>

type EdgeIterator: Iterator<Item = (&'a N, &'a N)>

Required Methods

fn order(&self) -> usize

Returns the number of nodes in this graph.

fn size(&self) -> usize

Returns the number of edges in this graph.

fn nodes(&'a self) -> Self::NodeIterator

Iterates the nodes of this graph

fn has_node(&self, node: &N) -> bool

Returns true if node is a member, or false otherwise.

fn neighbors(&'a self, node: &N) -> Result<Self::NeighborIterator, E>

Iterates the neighbors of node.

fn degree(&self, node: &N) -> Result<usize, E>

Returns the number of neighbors connected to node.

fn edges(&'a self) -> Self::EdgeIterator

Iterates the edges of this graph.

fn has_edge(&self, source: &N, target: &N) -> Result<bool, E>

Returns true if an edge exists between source and target.

Provided Methods

fn is_empty(&self) -> bool

Returns true if there are no nodes, or false otherwise.

Implementors