Struct FilterNodes 

pub struct FilterNodes<G, F> { /* private fields */ }

A graph whose nodes are being filtered by the predicate F.

Created by the Graph::filter_nodes trait method.

Trait Implementations

impl<G, F> Debug for FilterNodes<G, F>

where G: Debug,

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<G, F, Node> Graph<Node> for FilterNodes<G, F>

where G: Graph<Node>, F: Fn(&Node) -> bool,

type NodesIter<'a> = Filter<<G as Graph<Node>>::NodesIter<'a>, &'a F> where Self: 'a

The iterator type returned by Nodes::nodes.

type SuccessorsIter<'a> = Filter<<G as Graph<Node>>::SuccessorsIter<'a>, &'a F> where Self: 'a

The iterator type returned by Successors::successors.

fn nodes(&self) -> Self::NodesIter<'_>

Iterate over the nodes in this graph.

fn successors(&self, node: Node) -> Self::SuccessorsIter<'_>

Iterate over the successors of the given node.

fn by_ref(&self) -> &Self

Like Iterator::by_ref but for Graph.

fn filter_nodes<F>(self, predicate: F) -> FilterNodes<Self, F>

where Self: Sized, F: Fn(&Node) -> bool,

Use the given predicate to filter out certain nodes from the graph.