Trait rs_graph::traits::FiniteDigraph

pub trait FiniteDigraph: FiniteGraph {
    // Required methods
    fn src(&self, e: Self::Edge<'_>) -> Self::Node<'_>;
    fn snk(&self, e: Self::Edge<'_>) -> Self::Node<'_>;
}

A (finite) directed graph with a known number of nodes and edges.

For each edge the source and the sink node may be returned.

Required Methods

fn src(&self, e: Self::Edge<'_>) -> Self::Node<'_>

Return the source node of an edge.

fn snk(&self, e: Self::Edge<'_>) -> Self::Node<'_>

Return the sink node of an edge.

Implementations on Foreign Types

impl<'g, G> FiniteDigraph for &'g Gwhere G: FiniteDigraph,

fn src(&self, e: Self::Edge<'_>) -> Self::Node<'_>

fn snk(&self, e: Self::Edge<'_>) -> Self::Node<'_>

impl<G> FiniteDigraph for Rc<G>where G: FiniteDigraph,

fn src(&self, e: Self::Edge<'_>) -> Self::Node<'_>

fn snk(&self, e: Self::Edge<'_>) -> Self::Node<'_>

Implementors

impl<'g, G> FiniteDigraph for Network<'g, G>where G: FiniteDigraph,

impl<'g, G> FiniteDigraph for ReverseDigraph<'g, G>where G: FiniteDigraph,

impl<ID> FiniteDigraph for VecGraph<ID>where ID: PrimInt + Unsigned,

impl<ID, N, E> FiniteDigraph for LinkedListGraph<ID, N, E>where ID: PrimInt + Unsigned + 'static,