Trait petgraph::visit::FilterNode

source ·
pub trait FilterNode<N> {
    // Required method
    fn include_node(&self, node: N) -> bool;
}
Expand description

A graph filter for nodes.

Required Methods§

source

fn include_node(&self, node: N) -> bool

Return true to have the node be part of the graph

Implementations on Foreign Types§

source§

impl<N> FilterNode<N> for &FixedBitSet

source§

fn include_node(&self, n: N) -> bool

source§

impl<N> FilterNode<N> for FixedBitSet

This filter includes the nodes that are contained in the set.

source§

fn include_node(&self, n: N) -> bool

source§

impl<N, S> FilterNode<N> for &HashSet<N, S>
where HashSet<N, S>: VisitMap<N>,

source§

fn include_node(&self, n: N) -> bool

source§

impl<N, S> FilterNode<N> for HashSet<N, S>
where HashSet<N, S>: VisitMap<N>,

This filter includes the nodes that are contained in the set.

source§

fn include_node(&self, n: N) -> bool

Implementors§

source§

impl<F, N> FilterNode<N> for F
where F: Fn(N) -> bool,