Struct petgraph::visit::EdgeFiltered
source · pub struct EdgeFiltered<G, F>(pub G, pub F);
Expand description
An edge-filtering graph adaptor.
The adaptor may filter out edges. The filter implements the trait
FilterEdge
. Closures of type Fn(G::EdgeRef) -> bool
already
implement this trait.
The filter may use edge source, target, id, and weight to select whether to include the edge or not.
Tuple Fields§
§0: G
§1: F
Implementations§
source§impl<F, G> EdgeFiltered<G, F>
impl<F, G> EdgeFiltered<G, F>
Trait Implementations§
source§impl<G: Clone, F: Clone> Clone for EdgeFiltered<G, F>
impl<G: Clone, F: Clone> Clone for EdgeFiltered<G, F>
source§fn clone(&self) -> EdgeFiltered<G, F>
fn clone(&self) -> EdgeFiltered<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 EdgeFiltered<G, F>where
G: Data,
impl<G, F> Data for EdgeFiltered<G, F>where
G: Data,
type NodeWeight = <G as Data>::NodeWeight
type EdgeWeight = <G as Data>::EdgeWeight
source§impl<G, F> EdgeIndexable for EdgeFiltered<G, F>where
G: EdgeIndexable,
impl<G, F> EdgeIndexable for EdgeFiltered<G, F>where
G: EdgeIndexable,
source§fn edge_bound(&self) -> usize
fn edge_bound(&self) -> usize
Return an upper bound of the edge indices in the graph
(suitable for the size of a bitmap).
source§fn from_index(&self, i: usize) -> Self::EdgeId
fn from_index(&self, i: usize) -> Self::EdgeId
Convert
i
to an edge index. i
must be a valid value in the graph.source§impl<G, F> GraphBase for EdgeFiltered<G, F>where
G: GraphBase,
impl<G, F> GraphBase for EdgeFiltered<G, F>where
G: GraphBase,
source§impl<G, F> GraphProp for EdgeFiltered<G, F>where
G: GraphProp,
impl<G, F> GraphProp for EdgeFiltered<G, F>where
G: GraphProp,
source§impl<'a, G, F> IntoEdgeReferences for &'a EdgeFiltered<G, F>
impl<'a, G, F> IntoEdgeReferences for &'a EdgeFiltered<G, F>
type EdgeRef = <G as IntoEdgeReferences>::EdgeRef
type EdgeReferences = EdgeFilteredEdges<'a, G, <G as IntoEdgeReferences>::EdgeReferences, F>
fn edge_references(self) -> Self::EdgeReferences
source§impl<'a, G, F> IntoEdges for &'a EdgeFiltered<G, F>
impl<'a, G, F> IntoEdges for &'a EdgeFiltered<G, F>
source§impl<'a, G, F> IntoEdgesDirected for &'a EdgeFiltered<G, F>
impl<'a, G, F> IntoEdgesDirected for &'a EdgeFiltered<G, F>
type EdgesDirected = EdgeFilteredEdges<'a, G, <G as IntoEdgesDirected>::EdgesDirected, F>
fn edges_directed(self, n: G::NodeId, dir: Direction) -> Self::EdgesDirected
source§impl<'a, G, F> IntoNeighbors for &'a EdgeFiltered<G, F>
impl<'a, G, F> IntoNeighbors for &'a EdgeFiltered<G, F>
source§impl<'a, G, F> IntoNeighborsDirected for &'a EdgeFiltered<G, F>
impl<'a, G, F> IntoNeighborsDirected for &'a EdgeFiltered<G, F>
type NeighborsDirected = EdgeFilteredNeighborsDirected<'a, G, F>
fn neighbors_directed( self, n: G::NodeId, dir: Direction, ) -> Self::NeighborsDirected
source§impl<'a, G, F> IntoNodeIdentifiers for &'a EdgeFiltered<G, F>where
G: IntoNodeIdentifiers,
impl<'a, G, F> IntoNodeIdentifiers for &'a EdgeFiltered<G, F>where
G: IntoNodeIdentifiers,
type NodeIdentifiers = <G as IntoNodeIdentifiers>::NodeIdentifiers
fn node_identifiers(self) -> Self::NodeIdentifiers
source§impl<'a, G, F> IntoNodeReferences for &'a EdgeFiltered<G, F>where
G: IntoNodeReferences,
impl<'a, G, F> IntoNodeReferences for &'a EdgeFiltered<G, F>where
G: IntoNodeReferences,
type NodeRef = <G as IntoNodeReferences>::NodeRef
type NodeReferences = <G as IntoNodeReferences>::NodeReferences
fn node_references(self) -> Self::NodeReferences
source§impl<G, F> NodeCount for EdgeFiltered<G, F>where
G: NodeCount,
impl<G, F> NodeCount for EdgeFiltered<G, F>where
G: NodeCount,
fn node_count(&self) -> usize
source§impl<G, F> NodeIndexable for EdgeFiltered<G, F>where
G: NodeIndexable,
impl<G, F> NodeIndexable for EdgeFiltered<G, F>where
G: NodeIndexable,
source§fn node_bound(&self) -> usize
fn node_bound(&self) -> usize
Return an upper bound of the node indices in the graph
(suitable for the size of a bitmap).
source§fn from_index(&self, i: usize) -> Self::NodeId
fn from_index(&self, i: usize) -> Self::NodeId
Convert
i
to a node index. i
must be a valid value in the graph.source§impl<G, F> Visitable for EdgeFiltered<G, F>where
G: Visitable,
impl<G, F> Visitable for EdgeFiltered<G, F>where
G: Visitable,
impl<G: Copy, F: Copy> Copy for EdgeFiltered<G, F>
impl<G, F> NodeCompactIndexable for EdgeFiltered<G, F>where
G: NodeCompactIndexable,
Auto Trait Implementations§
impl<G, F> Freeze for EdgeFiltered<G, F>
impl<G, F> RefUnwindSafe for EdgeFiltered<G, F>where
G: RefUnwindSafe,
F: RefUnwindSafe,
impl<G, F> Send for EdgeFiltered<G, F>
impl<G, F> Sync for EdgeFiltered<G, F>
impl<G, F> Unpin for EdgeFiltered<G, F>
impl<G, F> UnwindSafe for EdgeFiltered<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
source§impl<T> CloneToUninit for Twhere
T: Copy,
impl<T> CloneToUninit for Twhere
T: Copy,
source§unsafe fn clone_to_uninit(&self, dst: *mut T)
unsafe fn clone_to_uninit(&self, dst: *mut T)
🔬This is a nightly-only experimental API. (
clone_to_uninit
)source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
source§default unsafe fn clone_to_uninit(&self, dst: *mut T)
default unsafe fn clone_to_uninit(&self, dst: *mut T)
🔬This is a nightly-only experimental API. (
clone_to_uninit
)