Trait DirectedGraph 

pub trait DirectedGraph<'a, N: 'a, E>: Graph<'a, N, E> {
    type OutIterator: Iterator<Item = &'a N>;
    type InIterator: Iterator<Item = &'a N>;

    // Required methods
    fn outgoing(&'a self, node: &N) -> Result<Self::OutIterator, E>;
    fn incoming(&'a self, node: &N) -> Result<Self::InIterator, E>;
}

Required Associated Types

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

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

Required Methods

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

Iterates the outgoing neighbors of node.

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

Iterates the incoming neighbors of node.

Implementors