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 OutIt = Filtered<G::OutIt>

Type of a graph iterator over edges leaving a node.

type InIt = Filtered<G::InIt>

Type of a graph iterator over edges entering a node.

type IncidentIt = FilteredIncidentIt<G::IncidentIt>

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 out_iter(&'a self, u: Self::Node) -> Self::OutIt

Return a graph iterator over the edges leaving a node.

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

Return a graph iterator over the edges leaving a node.

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

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

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

Return an iterator over the edges leaving a node.

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

Return access to the outgoing arcs via an Adjacencies trait.

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

Return an iterator over the edges leaving a node.

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

Return access to the incoming arcs via an Adjacencies trait.

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

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

impl<'a, G, P, I> GraphIterator<FilteredGraph<'a, G, P>> for Filtered<I> where
    G: GraphType<'a>,
    P: for<'r> Fn(&'r G::Edge) -> bool,
    I: GraphIterator<G, Item = (G::Edge, G::Node)>, 

type Item = I::Item

fn next(&mut self, g: &FilteredGraph<'a, G, P>) -> Option<Self::Item>

fn size_hint(&self, _g: &G) -> (usize, Option<usize>)

fn count(self, g: &G) -> usize

fn iter<'a>(self, g: &'a G) -> GraphIter<'a, G, Self> where
    G: Sized, 

impl<'a, G, P, I> GraphIterator<FilteredGraph<'a, G, P>> for FilteredIncidentIt<I> where
    G: Directed<'a>,
    P: for<'r> Fn(&'r G::Edge) -> bool,
    I: GraphIterator<G, Item = (G::DirectedEdge, G::Node)>, 

type Item = I::Item

fn next(&mut self, g: &FilteredGraph<'a, G, P>) -> Option<Self::Item>

fn size_hint(&self, _g: &G) -> (usize, Option<usize>)

fn count(self, g: &G) -> usize

fn iter<'a>(self, g: &'a G) -> GraphIter<'a, G, Self> where
    G: Sized, 

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

type Item = I::Item

fn next(&mut self, g: &FilteredGraph<'a, G, P>) -> Option<I::Item>

fn size_hint(&self, g: &FilteredGraph<'a, G, P>) -> (usize, Option<usize>)

fn count(self, g: &FilteredGraph<'a, G, P>) -> usize

fn iter<'a>(self, g: &'a G) -> GraphIter<'a, G, Self> where
    G: Sized, 

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

type Item = G::Edge

fn next(&mut self, g: &FilteredGraph<'a, G, P>) -> Option<G::Edge>

fn size_hint(&self, _g: &G) -> (usize, Option<usize>)

fn count(self, g: &G) -> usize

fn iter<'a>(self, g: &'a G) -> GraphIter<'a, G, Self> where
    G: Sized, 

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 NodeIt = FilterWrapIt<G::NodeIt>

Type of an iterator over all nodes.

type EdgeIt = FilterEdgeIt<G::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(&'a self) -> Self::NodeIt

Return a graph iterator over all nodes.

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

Return a graph iterator over all edges.

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

Return an iterator over all nodes.

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

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 NeighIt = Filtered<G::NeighIt>

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 neigh_iter(&'a self, u: Self::Node) -> Self::NeighIt

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

fn neighs(&'a self, u: Self::Node) -> GraphIter<'a, Self, Self::NeighIt> 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.