[−][src]Struct petgraph::visit::EdgeFiltered
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.
Implementations
impl<F, G> EdgeFiltered<G, F> where
G: IntoEdgeReferences,
F: Fn(G::EdgeRef) -> bool,
[src][−]
G: IntoEdgeReferences,
F: Fn(G::EdgeRef) -> bool,
pub fn from_fn(graph: G, filter: F) -> Self
[src][−]
Create an EdgeFiltered
adaptor from the closure filter
.
Trait Implementations
impl<G: Clone, F: Clone> Clone for EdgeFiltered<G, F>
[src][+]
impl<G: Copy, F: Copy> Copy for EdgeFiltered<G, F>
[src]
impl<G, F> Data for EdgeFiltered<G, F> where
G: Data,
[src]
G: Data,
type NodeWeight = G::NodeWeight
type EdgeWeight = G::EdgeWeight
impl<G: Debug, F: Debug> Debug for EdgeFiltered<G, F>
[src][+]
impl<G, F> GraphBase for EdgeFiltered<G, F> where
G: GraphBase,
[src]
G: GraphBase,
impl<G, F> GraphProp for EdgeFiltered<G, F> where
G: GraphProp,
[src][+]
G: GraphProp,
impl<'a, G, F> IntoEdgeReferences for &'a EdgeFiltered<G, F> where
G: IntoEdgeReferences,
F: FilterEdge<G::EdgeRef>,
[src][+]
G: IntoEdgeReferences,
F: FilterEdge<G::EdgeRef>,
impl<'a, G, F> IntoEdges for &'a EdgeFiltered<G, F> where
G: IntoEdges,
F: FilterEdge<G::EdgeRef>,
[src][+]
G: IntoEdges,
F: FilterEdge<G::EdgeRef>,
impl<'a, G, F> IntoNeighbors for &'a EdgeFiltered<G, F> where
G: IntoEdges,
F: FilterEdge<G::EdgeRef>,
[src][+]
G: IntoEdges,
F: FilterEdge<G::EdgeRef>,
impl<'a, G, F> IntoNeighborsDirected for &'a EdgeFiltered<G, F> where
G: IntoEdgesDirected,
F: FilterEdge<G::EdgeRef>,
[src][+]
G: IntoEdgesDirected,
F: FilterEdge<G::EdgeRef>,
impl<'a, G, F> IntoNodeIdentifiers for &'a EdgeFiltered<G, F> where
G: IntoNodeIdentifiers,
[src][+]
G: IntoNodeIdentifiers,
impl<'a, G, F> IntoNodeReferences for &'a EdgeFiltered<G, F> where
G: IntoNodeReferences,
[src][+]
G: IntoNodeReferences,
impl<G, F> NodeCompactIndexable for EdgeFiltered<G, F> where
G: NodeCompactIndexable,
[src]
G: NodeCompactIndexable,
impl<G, F> NodeCount for EdgeFiltered<G, F> where
G: NodeCount,
[src][+]
G: NodeCount,
impl<G, F> NodeIndexable for EdgeFiltered<G, F> where
G: NodeIndexable,
[src][+]
G: NodeIndexable,
impl<G, F> Visitable for EdgeFiltered<G, F> where
G: Visitable,
[src][+]
G: Visitable,
Auto Trait Implementations
impl<G, F> RefUnwindSafe for EdgeFiltered<G, F> where
F: RefUnwindSafe,
G: RefUnwindSafe,
F: RefUnwindSafe,
G: RefUnwindSafe,
impl<G, F> Send for EdgeFiltered<G, F> where
F: Send,
G: Send,
F: Send,
G: Send,
impl<G, F> Sync for EdgeFiltered<G, F> where
F: Sync,
G: Sync,
F: Sync,
G: Sync,
impl<G, F> Unpin for EdgeFiltered<G, F> where
F: Unpin,
G: Unpin,
F: Unpin,
G: Unpin,
impl<G, F> UnwindSafe for EdgeFiltered<G, F> where
F: UnwindSafe,
G: UnwindSafe,
F: UnwindSafe,
G: UnwindSafe,
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src][+]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src][+]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src][+]
T: ?Sized,
impl<T> From<T> for T
[src][+]
impl<T, U> Into<U> for T where
U: From<T>,
[src][+]
U: From<T>,
impl<T> ToOwned for T where
T: Clone,
[src][+]
T: Clone,
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src][+]
U: Into<T>,
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src][+]
U: TryFrom<T>,