[][src]Trait bigraph::NavigableGraph

pub trait NavigableGraph<'a>: GraphBase where
    <Self::OutNeighbors as IntoIterator>::Item == Neighbor<Self::NodeIndex, Self::EdgeIndex>,
    <Self::InNeighbors as IntoIterator>::Item == Neighbor<Self::NodeIndex, Self::EdgeIndex>, 
{ type OutNeighbors: IntoIterator; type InNeighbors: IntoIterator; fn out_neighbors(&'a self, node_id: Self::NodeIndex) -> Self::OutNeighbors;
fn in_neighbors(&'a self, node_id: Self::NodeIndex) -> Self::InNeighbors; }

Associated Types

Loading content...

Required methods

fn out_neighbors(&'a self, node_id: Self::NodeIndex) -> Self::OutNeighbors

fn in_neighbors(&'a self, node_id: Self::NodeIndex) -> Self::InNeighbors

Loading content...

Implementors

impl<'a, NodeData, EdgeData> NavigableGraph<'a> for Graph<NodeData, EdgeData, Directed, usize> where
    EdgeData: 'a, 
[src]

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>>

impl<'a, Topology: NavigableGraph<'a>> NavigableGraph<'a> for NodeBigraphWrapper<Topology>[src]

type OutNeighbors = <Topology as NavigableGraph<'a>>::OutNeighbors

type InNeighbors = <Topology as NavigableGraph<'a>>::InNeighbors

Loading content...