Struct rs_graph::adapters::ReverseDigraph

pub struct ReverseDigraph<'a, G>(_);

A digraph wrapping an existing graph with edges in opposite directions.

The sets of outgoing and incoming edges handled by the methods of Digraph and Network are swapped, so incoming edges becoming outgoing edges and vice versa.

Example

use rs_graph::LinkedListGraph;
use rs_graph::traits::*;
use rs_graph::reverse;
use rs_graph::classes::star;

let g = star::<LinkedListGraph>(42);
assert_eq!(g.num_nodes(), 43);
assert_eq!(g.num_edges(), 42);
assert!(g.edges().all(|e| g.node_id(g.src(e)) == 0 && g.node_id(g.snk(e)) > 0));
assert!(g.outedges(g.id2node(0)).all(|(_,v)| g.node_id(v) > 0));
assert!(g.inedges(g.id2node(0)).all(|(_,v)| g.node_id(v) == 0));
assert_eq!(g.outedges(g.id2node(0)).count(), 42);
assert_eq!(g.inedges(g.id2node(0)).count(), 0);

// Can be used by wrapping a reference.
{
    let g = reverse(&g);
    assert_eq!(g.num_nodes(), 43);
    assert_eq!(g.num_edges(), 42);
}

// Or by conversion.
let g = reverse(&g);
assert_eq!(g.num_nodes(), 43);
assert_eq!(g.num_edges(), 42);
assert!(g.edges().all(|e| g.node_id(g.snk(e)) == 0 && g.node_id(g.src(e)) > 0));
assert!(g.outedges(g.id2node(0)).all(|(_,v)| g.node_id(v) == 0));
assert!(g.inedges(g.id2node(0)).all(|(_,v)| g.node_id(v) > 0));
assert_eq!(g.outedges(g.id2node(0)).count(), 0);
assert_eq!(g.inedges(g.id2node(0)).count(), 42);

Trait Implementations

impl<'a, G: Clone> Clone for ReverseDigraph<'a, G>

fn clone(&self) -> ReverseDigraph<'a, G>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

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

type OutIt<'a> = ReverseWrapIt<<G as Directed>::InIt<'a>> where G: 'a, 'g: 'a

Type of a graph iterator over edges leaving a node.

type InIt<'a> = ReverseWrapIt<<G as Directed>::OutIt<'a>> where G: 'a, 'g: 'a

Type of a graph iterator over edges entering a node.

type IncidentIt<'a> = ReverseIncidentIt<<G as Directed>::IncidentIt<'a>> where G: 'a, 'g: 'a

Type of an iterator over all incident edges.

type DirectedEdge<'a> = ReverseDirectedEdge<<G as Directed>::DirectedEdge<'a>> where Self: 'a

Type of a directed edge.

fn out_iter(&self, u: Self::Node<'_>) -> Self::OutIt<'_>

Return a graph iterator over the edges leaving a node.

fn in_iter(&self, u: Self::Node<'_>) -> Self::InIt<'_>

Return a graph iterator over the edges leaving a node.

fn incident_iter(&self, u: Self::Node<'_>) -> Self::IncidentIt<'_>

Return an iterator over all directed edges incident with a node.

fn outedges( &self, u: Self::Node<'_> ) -> GraphIter<'_, Self, <Self as Directed>::OutIt<'_>> where Self: Sized,

Return an iterator over the edges leaving a node.

fn outgoing(&self) -> OutEdges<'_, Self>where Self: Sized,

Return access to the outgoing arcs via an Adjacencies trait.

fn inedges( &self, u: Self::Node<'_> ) -> GraphIter<'_, Self, <Self as Directed>::InIt<'_>> where Self: Sized,

Return an iterator over the edges leaving a node.

fn incoming(&self) -> InEdges<'_, Self>where Self: Sized,

Return access to the incoming arcs via an Adjacencies trait.

fn incident_edges( &self, u: Self::Node<'_> ) -> GraphIter<'_, Self, <Self as Directed>::IncidentIt<'_>> where Self: Sized,

Return an iterator over all directed edges incident with a node.

impl<'a, G> DirectedRef<'a> for ReverseDigraph<'a, G>where G: DirectedRef<'a>,

type OutIt = ReverseWrapIt<<G as DirectedRef<'a>>::InIt>

Type of a graph iterator over edges leaving a node.

type InIt = ReverseWrapIt<<G as DirectedRef<'a>>::OutIt>

Type of a graph iterator over edges entering a node.

type IncidentIt = ReverseIncidentIt<<G as DirectedRef<'a>>::IncidentIt>

Type of an iterator over all incident edges.

type DirectedEdge = ReverseDirectedEdge<<G as DirectedRef<'a>>::DirectedEdge>

Type of a directed edge.

fn out_iter(&self, u: Self::Node) -> Self::OutIt

Return the source node of an edge. Return the sink node of an edge. Return a graph iterator over the edges leaving a node.

fn in_iter(&self, u: Self::Node) -> Self::InIt

Return a graph iterator over the edges leaving a node.

fn incident_iter(&self, u: Self::Node) -> Self::IncidentIt

Return an iterator over all directed edges incident with a node.

fn outedges(&self, u: Self::Node) -> GraphIter<'_, Self, Self::OutIt> where Self: Sized,

Return an iterator over the edges leaving a node.

fn inedges(&self, u: Self::Node) -> GraphIter<'_, Self, Self::InIt> where Self: Sized,

Return an iterator over the edges leaving a node.

fn incident_edges(&self, u: Self::Node) -> GraphIter<'_, Self, Self::IncidentIt> where Self: Sized,

Return an iterator over all directed edges incident with a node.

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

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.

impl<'a, G> FiniteDigraphRef<'a> for ReverseDigraph<'a, G>where G: FiniteDigraphRef<'a>,

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

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

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

type NodeIt<'a> = ReverseWrapIt<<G as FiniteGraph>::NodeIt<'a>> where G: 'a, 'g: 'a

Type of an iterator over all nodes.

type EdgeIt<'a> = ReverseWrapIt<<G as FiniteGraph>::EdgeIt<'a>> where G: 'a, 'g: 'a

Type of an iterator over all edges.

fn num_nodes(&self) -> usize

Return the number of nodes in the graph.

fn num_edges(&self) -> usize

Return the number of edges in the graph.

fn nodes_iter(&self) -> Self::NodeIt<'_>

Return a graph iterator over all nodes.

fn edges_iter(&self) -> Self::EdgeIt<'_>

Return a graph iterator over all edges.

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

Return the nodes connected by an edge.

fn nodes(&self) -> NodeIterator<'_, Self>where Self: Sized,

Return an iterator over all nodes.

fn edges(&self) -> EdgeIterator<'_, Self>where Self: Sized,

Return an iterator over all edges.

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

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

Type of an iterator over all nodes.

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

Type of an iterator over all edges.

fn num_nodes(&self) -> usize

Return the number of nodes in the graph.

fn num_edges(&self) -> usize

Return the number of edges in the graph.

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

Return a graph iterator over all nodes.

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

Return a graph iterator over all edges.

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

Return the nodes connected by an edge.

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.

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

type Node<'a> = <G as GraphType>::Node<'a>

Type of a node.

type Edge<'a> = <G as GraphType>::Edge<'a>

Type of an edge.

impl<'a, G> GraphTypeRef<'a> for ReverseDigraph<'a, G>where G: GraphTypeRef<'a>,

type Node = <G as GraphTypeRef<'a>>::Node

Type of a node.

type Edge = <G as GraphTypeRef<'a>>::Edge

Type of an edge.

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

fn node_id(&self, u: Self::Node<'_>) -> usize

Return a unique id associated with a node.

fn id2node(&self, id: usize) -> Self::Node<'_>

Return the node associated with the given id.

fn edge_id(&self, e: Self::Edge<'_>) -> usize

Return a unique id associated with an edge.

fn id2edge(&self, id: usize) -> Self::Edge<'_>

Return the edge associated with the given id.

impl<'a, G> IndexGraphRef<'a> for ReverseDigraph<'a, G>where G: IndexGraphRef<'a>,

fn node_id(&self, u: Self::Node) -> usize

Return a unique id associated with a node.

fn edge_id(&self, e: Self::Edge) -> usize

Return a unique id associated with an edge.

fn id2node(&self, id: usize) -> Self::Node

Return the node associated with the given id.

fn id2edge(&self, id: usize) -> Self::Edge

Return the edge associated with the given id.

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

type NeighIt<'a> = ReverseWrapIt<<G as Undirected>::NeighIt<'a>> where G: 'a, 'g: 'a

Type of a graph iterator over all incident edges.

fn neigh_iter(&self, u: Self::Node<'_>) -> Self::NeighIt<'_>

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

fn neighs( &self, u: Self::Node<'_> ) -> GraphIter<'_, Self, <Self as Undirected>::NeighIt<'_>> where Self: Sized,

Return an iterator over the edges adjacent to some node.

fn neighbors(&self) -> Neighbors<'_, Self>where Self: Sized,

Return access to the neighbors via an Adjacencies trait.

impl<'a, G> UndirectedRef<'a> for ReverseDigraph<'a, G>where G: UndirectedRef<'a>,

type NeighIt = ReverseWrapIt<<G as UndirectedRef<'a>>::NeighIt>

Type of a graph iterator over all incident edges.

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

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

fn neighs(&self, u: Self::Node) -> GraphIter<'_, Self, Self::NeighIt> where Self: Sized,

Return an iterator over the edges adjacent to some node.

impl<'a, G: Copy> Copy for ReverseDigraph<'a, G>