Struct rs_graph::filtered::FilteredGraph

pub struct FilteredGraph<'a, G, P> where
    G: GraphType<'a>,
    P: for<'r> Fn(&'r G::Edge) -> bool,  { /* fields omitted */ }

Trait Implementations

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

type OutEdge = Filtered<G::OutEdge>

Type of a graph iterator over edges leaving a node.

type InEdge = Filtered<G::InEdge>

Type of a graph iterator over edges entering a node.

type IncidentEdge = Filtered<G::IncidentEdge>

Type of an iterator over all incident edges.

type DirectedEdge = G::DirectedEdge

Type of a directed edge.

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

Return the source node of an edge.

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

Return the sink node of an edge.

fn first_out(&'a self, u: Self::Node) -> Option<Self::OutEdge>

Return an iterator over the edges leaving a node.

fn next_out(&'a self, it: Self::OutEdge) -> Option<Self::OutEdge>

Advance the iterator to the next outgoing edge.

fn get_out(&'a self, it: &Self::OutEdge) -> (Self::Edge, Self::Node)

Return the edge and sink node of an outgoing edge iterator.

fn first_in(&'a self, u: Self::Node) -> Option<Self::InEdge>

Return an iterator over the edges entering a node.

fn next_in(&'a self, it: Self::InEdge) -> Option<Self::InEdge>

Advance the iterator to the next incoming edge.

fn get_in(&'a self, it: &Self::InEdge) -> (Self::Edge, Self::Node)

Return the edge and sink node of an incoming edge iterator.

fn first_incident(&'a self, u: Self::Node) -> Option<Self::IncidentEdge>

Return an iterator over the edges entering a node.

fn next_incident(&'a self, it: Self::IncidentEdge) -> Option<Self::IncidentEdge>

Advance the iterator to the next incoming edge.

fn get_incident(
    &'a self,
    it: &Self::IncidentEdge
) -> (Self::DirectedEdge, Self::Node)

Return the edge and sink node of an incoming edge iterator.

Important traits for OutEdgeIter<'a, G>

impl<'a, G> Iterator for OutEdgeIter<'a, G> where
    G: Directed<'a>,  type Item = (G::Edge, G::Node);

fn outedges(&'a self, u: Self::Node) -> OutEdgeIter<'a, Self> where
    Self: Sized, 

Return an iterator over the outgoing edges of a node.

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

Return access to the outgoing arcs via an Adjacencies trait.

Important traits for InEdgeIter<'a, G>

impl<'a, G> Iterator for InEdgeIter<'a, G> where
    G: Directed<'a>,  type Item = (G::Edge, G::Node);

fn inedges(&'a self, u: Self::Node) -> InEdgeIter<'a, Self> where
    Self: Sized, 

Return an iterator over the incoming edges of a node.

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

Return access to the incoming arcs via an Adjacencies trait.

Important traits for IncidentEdgeIter<'a, G>

impl<'a, G> Iterator for IncidentEdgeIter<'a, G> where
    G: Directed<'a>,  type Item = (G::DirectedEdge, G::Node);

fn incident_edges(&'a self, u: Self::Node) -> IncidentEdgeIter<'a, Self> where
    Self: Sized, 

Return access to all incident edges of a node.

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

type NodeIter = G::NodeIter

Type of an iterator over all nodes.

type EdgeIter = Filter<G::EdgeIter, &'a P>

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(&'a self) -> Self::NodeIter

Return an iterator over all nodes.

fn edges(&'a self) -> Self::EdgeIter

Return an iterator over all edges.

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

type Node = G::Node

Type of a node.

type Edge = G::Edge

Type of an edge.

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

type Neigh = Filtered<G::Neigh>

Type of a graph iterator over all incident edges.

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

Return the nodes connected by an edge.

fn first_neigh(&'a self, u: Self::Node) -> Option<Self::Neigh>

Return an iterator over the edges adjacent to some node.

fn next_neigh(&'a self, it: Self::Neigh) -> Option<Self::Neigh>

Advance the iterator to the next adjacent edge.

fn get_neigh(&'a self, it: &Self::Neigh) -> (Self::Edge, Self::Node)

Return the edge and neighboring node of an iterator.

Important traits for NeighIter<'a, G>

impl<'a, G> Iterator for NeighIter<'a, G> where
    G: Undirected<'a>,  type Item = (G::Edge, G::Node);

fn neighs(&'a self, u: Self::Node) -> NeighIter<Self> where
    Self: Sized, 

Return an iterator over the edges adjacent to some node.

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

Return access to the neighbors via an Adjacencies trait.