Struct petgraph::visit::filter::NodeFiltered
source · pub struct NodeFiltered<G, F>(pub G, pub F);
Expand description
A node-filtering graph adaptor.
Tuple Fields§
§0: G
§1: F
Implementations§
Trait Implementations§
source§impl<G: Clone, F: Clone> Clone for NodeFiltered<G, F>
impl<G: Clone, F: Clone> Clone for NodeFiltered<G, F>
source§fn clone(&self) -> NodeFiltered<G, F>
fn clone(&self) -> NodeFiltered<G, F>
Returns a copy of the value. Read more
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moresource§impl<G, F> Data for NodeFiltered<G, F>where
G: Data,
impl<G, F> Data for NodeFiltered<G, F>where
G: Data,
type NodeWeight = <G as Data>::NodeWeight
type EdgeWeight = <G as Data>::EdgeWeight
source§impl<G, F> DataMap for NodeFiltered<G, F>
impl<G, F> DataMap for NodeFiltered<G, F>
fn node_weight(&self, id: Self::NodeId) -> Option<&Self::NodeWeight>
fn edge_weight(&self, id: Self::EdgeId) -> Option<&Self::EdgeWeight>
source§impl<G, F> GraphBase for NodeFiltered<G, F>where
G: GraphBase,
impl<G, F> GraphBase for NodeFiltered<G, F>where
G: GraphBase,
source§impl<G, F> GraphProp for NodeFiltered<G, F>where
G: GraphProp,
impl<G, F> GraphProp for NodeFiltered<G, F>where
G: GraphProp,
source§impl<'a, G, F> IntoEdgeReferences for &'a NodeFiltered<G, F>
impl<'a, G, F> IntoEdgeReferences for &'a NodeFiltered<G, F>
type EdgeRef = <G as IntoEdgeReferences>::EdgeRef
type EdgeReferences = NodeFilteredEdgeReferences<'a, G, <G as IntoEdgeReferences>::EdgeReferences, F>
fn edge_references(self) -> Self::EdgeReferences
source§impl<'a, G, F> IntoEdges for &'a NodeFiltered<G, F>
impl<'a, G, F> IntoEdges for &'a NodeFiltered<G, F>
source§impl<'a, G, F> IntoNeighbors for &'a NodeFiltered<G, F>
impl<'a, G, F> IntoNeighbors for &'a NodeFiltered<G, F>
type Neighbors = NodeFilteredNeighbors<'a, <G as IntoNeighbors>::Neighbors, F>
source§impl<'a, G, F> IntoNeighborsDirected for &'a NodeFiltered<G, F>
impl<'a, G, F> IntoNeighborsDirected for &'a NodeFiltered<G, F>
type NeighborsDirected = NodeFilteredNeighbors<'a, <G as IntoNeighborsDirected>::NeighborsDirected, F>
fn neighbors_directed( self, n: G::NodeId, dir: Direction, ) -> Self::NeighborsDirected
source§impl<'a, G, F> IntoNodeIdentifiers for &'a NodeFiltered<G, F>
impl<'a, G, F> IntoNodeIdentifiers for &'a NodeFiltered<G, F>
type NodeIdentifiers = NodeFilteredNeighbors<'a, <G as IntoNodeIdentifiers>::NodeIdentifiers, F>
fn node_identifiers(self) -> Self::NodeIdentifiers
source§impl<'a, G, F> IntoNodeReferences for &'a NodeFiltered<G, F>
impl<'a, G, F> IntoNodeReferences for &'a NodeFiltered<G, F>
type NodeRef = <G as IntoNodeReferences>::NodeRef
type NodeReferences = NodeFilteredNodes<'a, <G as IntoNodeReferences>::NodeReferences, F>
fn node_references(self) -> Self::NodeReferences
source§impl<G, F> NodeIndexable for NodeFiltered<G, F>where
G: NodeIndexable,
impl<G, F> NodeIndexable for NodeFiltered<G, F>where
G: NodeIndexable,
source§impl<G, F> Visitable for NodeFiltered<G, F>where
G: Visitable,
impl<G, F> Visitable for NodeFiltered<G, F>where
G: Visitable,
impl<G: Copy, F: Copy> Copy for NodeFiltered<G, F>
Auto Trait Implementations§
impl<G, F> Freeze for NodeFiltered<G, F>
impl<G, F> RefUnwindSafe for NodeFiltered<G, F>where
G: RefUnwindSafe,
F: RefUnwindSafe,
impl<G, F> Send for NodeFiltered<G, F>
impl<G, F> Sync for NodeFiltered<G, F>
impl<G, F> Unpin for NodeFiltered<G, F>
impl<G, F> UnwindSafe for NodeFiltered<G, F>where
G: UnwindSafe,
F: UnwindSafe,
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more