Trait FiniteGraphRef

pub trait FiniteGraphRef<'a>: GraphTypeRef<'a> {
    type NodeIt: GraphIterator<Self, Item = Self::Node>;
    type EdgeIt: GraphIterator<Self, Item = Self::Edge>;

    // Required methods
    fn num_nodes(&self) -> usize;
    fn nodes_iter(&self) -> Self::NodeIt;
    fn num_edges(&self) -> usize;
    fn edges_iter(&self) -> Self::EdgeIt;
    fn enodes(&self, e: Self::Edge) -> (Self::Node, Self::Node);

    // Provided methods
    fn nodes(&self) -> GraphIter<'_, Self, Self::NodeIt> 
       where Self: Sized { ... }
    fn edges(&self) -> GraphIter<'_, Self, Self::EdgeIt> 
       where Self: Sized { ... }
}

A reference to a basic finite graph.

This trait contains methods with a unrestricted lifetime for self.

Required Associated Types

type NodeIt: GraphIterator<Self, Item = Self::Node>

Type of an iterator over all nodes.

type EdgeIt: GraphIterator<Self, Item = Self::Edge>

Type of an iterator over all edges.

Required Methods

fn num_nodes(&self) -> usize

Return the number of nodes in the graph.

fn nodes_iter(&self) -> Self::NodeIt

Return a graph iterator over all nodes.

fn num_edges(&self) -> usize

Return the number of edges in the graph.

fn edges_iter(&self) -> Self::EdgeIt

Return a graph iterator over all edges.

This iterator traverses only the forward edges.

fn enodes(&self, e: Self::Edge) -> (Self::Node, Self::Node)

Return the nodes connected by an edge.

The order of the nodes is undefined.

Provided Methods

fn nodes(&self) -> GraphIter<'_, Self, Self::NodeIt>

where Self: Sized,

Return an iterator over all nodes.

fn edges(&self) -> GraphIter<'_, Self, Self::EdgeIt>

where Self: Sized,

Return an iterator over all edges.

This iterator traverses only the forward edges.

Dyn Compatibility

This trait is not dyn compatible.

In older versions of Rust, dyn compatibility was called "object safety", so this trait is not object safe.

Implementations on Foreign Types

impl<'a, G> FiniteGraphRef<'a> for &'a G

where G: FiniteGraph,

type NodeIt = WrapIt<<G as FiniteGraph>::NodeIt<'a>>

type EdgeIt = WrapIt<<G as FiniteGraph>::EdgeIt<'a>>

fn num_nodes(&self) -> usize

fn nodes_iter(&self) -> Self::NodeIt

fn num_edges(&self) -> usize

fn edges_iter(&self) -> Self::EdgeIt

fn enodes(&self, e: Self::Edge) -> (Self::Node, Self::Node)

impl<'a, G> FiniteGraphRef<'a> for NonNull<G>

where G: FiniteGraph + 'a,

type NodeIt = WrapIt<<G as FiniteGraph>::NodeIt<'a>>

type EdgeIt = WrapIt<<G as FiniteGraph>::EdgeIt<'a>>

fn num_nodes(&self) -> usize

fn nodes_iter(&self) -> Self::NodeIt

fn num_edges(&self) -> usize

fn edges_iter(&self) -> Self::EdgeIt

fn enodes(&self, e: Self::Edge) -> (Self::Node, Self::Node)

Implementors

impl<'a, G> FiniteGraphRef<'a> for Network<'a, G>

where G: FiniteGraph,

type NodeIt = NetworkNodeIt<<G as FiniteGraph>::NodeIt<'a>>

type EdgeIt = NetworkEdgeIt<G, <G as FiniteGraph>::EdgeIt<'a>>

impl<'a, G> FiniteGraphRef<'a> for ReverseDigraph<'a, G>

where G: FiniteGraphRef<'a>,

type NodeIt = ReverseWrapIt<<G as FiniteGraphRef<'a>>::NodeIt>

type EdgeIt = ReverseWrapIt<<G as FiniteGraphRef<'a>>::EdgeIt>