[−][src]Trait graphrepresentations::graph::ForwardNavigableGraph

pub trait ForwardNavigableGraph<'a, N, E>: Graph<N, E> {
    type OutEdgeIterator: Iterator<Item = EdgeId> + 'a;
    fn out_edges(&self, id: NodeId) -> Self::OutEdgeIterator;
}

A forward navigable graph.

Graphs implementing this trait are able to output a nodes out-edges efficiently. For undirected graphs, out-edges and in-edges are the same.

Associated Types

type OutEdgeIterator: Iterator<Item = EdgeId> + 'a

An iterator over the out-edges of a node.

Loading content...

Required methods

fn out_edges(&self, id: NodeId) -> Self::OutEdgeIterator

Returns an iterator over the out-edges of the node identified by the given id.

Loading content...

Implementors

impl<'a, N, E> ForwardNavigableGraph<'a, N, E> for AdjacencyArray<N, E>[src]

type OutEdgeIterator = Map<Range<IdType>, fn(_: IdType) -> EdgeId>

Loading content...