Trait abstractgraph::directedgraph::OutboundEdge

pub trait OutboundEdge<N> {
    fn destination(&self) -> N;

    fn into_destination(self) -> N
    where
        Self: Sized,
    { ... }
}

The trait for types representing a single graph edge from a known graph node

This could be a reference to some internal part of your data structure, an index or whatever else is suitable for your graph representation.

Required methods

fn destination(&self) -> N

Returns the destination node of self

Loading content...

Provided methods

fn into_destination(self) -> N where
    Self: Sized, 

Consume self and return its destination node instead

Loading content...

Implementors

impl<N, E> OutboundEdge<N> for UnitWeightEdge<E> where
    E: OutboundEdge<N>, 

fn destination(&self) -> N

fn into_destination(self) -> N where
    Self: Sized, 

impl<N: Clone> OutboundEdge<N> for SimpleOutboundEdge<N>

fn destination(&self) -> N

fn into_destination(self) -> N

impl<N: Clone, W> OutboundEdge<N> for WeightedEdge<N, W>

fn destination(&self) -> N

fn into_destination(self) -> N

Loading content...