Trait rs_graph::traits::Undirected[−][src]

pub trait Undirected<'a>: GraphSize<'a> {
    type NeighIt: GraphIterator<Self, Item = (Self::Edge, Self::Node)>;
    fn enodes(&'a self, e: Self::Edge) -> (Self::Node, Self::Node);

    fn neigh_iter(&'a self, u: Self::Node) -> Self::NeighIt;

    fn neighs(&'a self, u: Self::Node) -> GraphIter<'a, Self, Self::NeighIt>ⓘ
Notable traits for GraphIter<'a, G, I>
impl<'a, G, I> Iterator for GraphIter<'a, G, I> where
    I: GraphIterator<G>,     type Item = I::Item;

    where
        Self: Sized,
    { ... }

    fn neighbors(&'a self) -> Neighbors<'a, Self>
    where
        Self: Sized,
    { ... }
}

A graph with list access to undirected incident edges.

Associated Types

type NeighIt: GraphIterator<Self, Item = (Self::Edge, Self::Node)>[src]

Type of a graph iterator over all incident edges.

Loading content...

Required methods

fn enodes(&'a self, e: Self::Edge) -> (Self::Node, Self::Node)[src]

Return the nodes connected by an edge.

The order of the nodes is undefined.

fn neigh_iter(&'a self, u: Self::Node) -> Self::NeighIt[src]

Return a graph iterator over the edges adjacent to some node.

Loading content...

Provided methods

fn neighs(&'a self, u: Self::Node) -> GraphIter<'a, Self, Self::NeighIt>ⓘ

Notable traits for GraphIter<'a, G, I>

impl<'a, G, I> Iterator for GraphIter<'a, G, I> where
    I: GraphIterator<G>,  type Item = I::Item;
 where
    Self: Sized, [src]

Return an iterator over the edges adjacent to some node.

fn neighbors(&'a self) -> Neighbors<'a, Self> where
    Self: Sized, [src]

Return access to the neighbors via an Adjacencies trait.

This is the same as calling Neighbors(&g) on the graph.

Loading content...

Implementations on Foreign Types

impl<'a, 'g: 'a, G> Undirected<'a> for &'g G where
    G: Undirected<'g>, [src]

type NeighIt = WrapIt<G::NeighIt>

Loading content...

Implementors

impl<'a, 'g: 'a, G> Undirected<'a> for Network<'g, G> where
    G: Digraph<'g>, [src]

type NeighIt = NetworkNeighIt<G, G::NeighIt>

impl<'a, 'g: 'a, G> Undirected<'a> for ReverseDigraph<'g, G> where
    G: Undirected<'g>, [src]

type NeighIt = ReverseWrapIt<G::NeighIt>

impl<'a, G, Gx, Nx, Ex> Undirected<'a> for Attributed<G, Gx, Nx, Ex> where
    G: Undirected<'a>,
    Gx: 'a + Default,
    Nx: 'a + Default,
    Ex: 'a + Default, [src]

type NeighIt = AttributedWrapIt<G::NeighIt>

impl<'a, G, P> Undirected<'a> for FilteredGraph<'a, G, P> where
    G: Undirected<'a>,
    P: 'a + for<'r> Fn(&'r G::Edge) -> bool, [src]

type NeighIt = Filtered<G::NeighIt>

impl<'a, ID> Undirected<'a> for VecGraph<ID> where
    ID: 'a + PrimInt + Unsigned, [src]

type NeighIt = NeighIt<'a, ID>

impl<'a, ID, N: 'a, E: 'a> Undirected<'a> for LinkedListGraph<ID, N, E> where
    ID: 'a + PrimInt + Unsigned, [src]

type NeighIt = NeighIt<ID>

Loading content...