[−][src]Trait bigraph::NavigableGraph
Associated Types
type OutNeighbors: IntoIterator
type InNeighbors: IntoIterator
Required methods
fn out_neighbors(&'a self, node_id: Self::NodeIndex) -> Self::OutNeighbors
fn in_neighbors(&'a self, node_id: Self::NodeIndex) -> Self::InNeighbors
Implementors
impl<'a, NodeData, EdgeData> NavigableGraph<'a> for Graph<NodeData, EdgeData, Directed, usize> where
EdgeData: 'a,
[src]
EdgeData: 'a,
type OutNeighbors = Map<Edges<'a, EdgeData, Directed, usize>, fn(EdgeReference<'a, EdgeData, usize>) -> Neighbor<<Graph<NodeData, EdgeData, Directed, usize> as GraphBase>::NodeIndex, <Graph<NodeData, EdgeData, Directed, usize> as GraphBase>::EdgeIndex>>
type InNeighbors = Map<Edges<'a, EdgeData, Directed, usize>, fn(EdgeReference<'a, EdgeData, usize>) -> Neighbor<<Graph<NodeData, EdgeData, Directed, usize> as GraphBase>::NodeIndex, <Graph<NodeData, EdgeData, Directed, usize> as GraphBase>::EdgeIndex>>
fn out_neighbors(
&'a self,
node_id: <Graph<NodeData, EdgeData, Directed, usize> as GraphBase>::NodeIndex
) -> <Graph<NodeData, EdgeData, Directed, usize> as NavigableGraph<'a>>::OutNeighbors
[src]
&'a self,
node_id: <Graph<NodeData, EdgeData, Directed, usize> as GraphBase>::NodeIndex
) -> <Graph<NodeData, EdgeData, Directed, usize> as NavigableGraph<'a>>::OutNeighbors
fn in_neighbors(
&'a self,
node_id: <Graph<NodeData, EdgeData, Directed, usize> as GraphBase>::NodeIndex
) -> <Graph<NodeData, EdgeData, Directed, usize> as NavigableGraph<'a>>::InNeighbors
[src]
&'a self,
node_id: <Graph<NodeData, EdgeData, Directed, usize> as GraphBase>::NodeIndex
) -> <Graph<NodeData, EdgeData, Directed, usize> as NavigableGraph<'a>>::InNeighbors