[][src]Trait bigraph::NavigableGraph

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

Associated Types

Loading content...

Required methods

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

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

Loading content...

Implementors

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

type OutNeighbors = Map<Edges<'a, EdgeData, Directed, usize>, fn(EdgeReference<'a, EdgeData, usize>) -> Neighbor<usize>>

type InNeighbors = Map<Edges<'a, EdgeData, Directed, usize>, fn(EdgeReference<'a, EdgeData, usize>) -> Neighbor<usize>>

impl<'a, NodeData, EdgeData, IndexType: PrimInt, T: NavigableGraph<'a, NodeData, EdgeData, IndexType>> NavigableGraph<'a, NodeData, EdgeData, IndexType> for NodeBigraphWrapper<NodeData, EdgeData, IndexType, T>[src]

type OutNeighbors = <T as NavigableGraph<'a, NodeData, EdgeData, IndexType>>::OutNeighbors

type InNeighbors = <T as NavigableGraph<'a, NodeData, EdgeData, IndexType>>::InNeighbors

Loading content...