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§
sourcefn include_node(&self, node: N) -> bool
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 &FixedBitSetwhere
FixedBitSet: VisitMap<N>,
impl<N> FilterNode<N> for &FixedBitSetwhere
FixedBitSet: VisitMap<N>,
fn include_node(&self, n: N) -> bool
source§impl<N> FilterNode<N> for FixedBitSetwhere
FixedBitSet: VisitMap<N>,
impl<N> FilterNode<N> for FixedBitSetwhere
FixedBitSet: VisitMap<N>,
This filter includes the nodes that are contained in the set.
fn include_node(&self, n: N) -> bool
source§impl<N, S> FilterNode<N> for &HashSet<N, S>
impl<N, S> FilterNode<N> for &HashSet<N, S>
fn include_node(&self, n: N) -> bool
source§impl<N, S> FilterNode<N> for HashSet<N, S>
impl<N, S> FilterNode<N> for HashSet<N, S>
This filter includes the nodes that are contained in the set.