[−][src]Trait graphrepresentations::graph::BackwardNavigableGraph
A backward navigable graph.
Graphs implementing this trait are able to output a nodes in-edges efficiently. For undirected graphs, out-edges and in-edges are the same.
Associated Types
type InEdgeIterator: Iterator<Item = EdgeId> + 'a
An iterator over the in-edges of a node.
Required methods
fn in_edges(&self, id: NodeId) -> Self::InEdgeIterator
Returns an iterator over the in-edges of the node identified by the given id.