[][src]Struct petgraph::visit::NodeFiltered

pub struct NodeFiltered<G, F>(pub G, pub F);

A node-filtering graph adaptor.

Implementations

impl<F, G> NodeFiltered<G, F> where
    G: GraphBase,
    F: Fn(G::NodeId) -> bool
[src]

pub fn from_fn(graph: G, filter: F) -> Self[src]

Create an NodeFiltered adaptor from the closure filter.

Trait Implementations

impl<G: Clone, F: Clone> Clone for NodeFiltered<G, F>[src]

impl<G: Copy, F: Copy> Copy for NodeFiltered<G, F>[src]

impl<G, F> Data for NodeFiltered<G, F> where
    G: Data
[src]

impl<G, F> DataMap for NodeFiltered<G, F> where
    G: DataMap,
    F: FilterNode<G::NodeId>, 
[src]

impl<G: Debug, F: Debug> Debug for NodeFiltered<G, F>[src]

impl<G, F> GraphBase for NodeFiltered<G, F> where
    G: GraphBase
[src]

type NodeId = G::NodeId

node identifier

type EdgeId = G::EdgeId

edge identifier

impl<G, F> GraphProp for NodeFiltered<G, F> where
    G: GraphProp
[src]

type EdgeType = G::EdgeType

The kind edges in the graph.

impl<'a, G, F> IntoEdgeReferences for &'a NodeFiltered<G, F> where
    G: IntoEdgeReferences,
    F: FilterNode<G::NodeId>, 
[src]

impl<'a, G, F> IntoEdges for &'a NodeFiltered<G, F> where
    G: IntoEdges,
    F: FilterNode<G::NodeId>, 
[src]

type Edges = NodeFilteredEdges<'a, G, G::Edges, F>

impl<'a, G, F> IntoNeighbors for &'a NodeFiltered<G, F> where
    G: IntoNeighbors,
    F: FilterNode<G::NodeId>, 
[src]

type Neighbors = NodeFilteredNeighbors<'a, G::Neighbors, F>

impl<'a, G, F> IntoNeighborsDirected for &'a NodeFiltered<G, F> where
    G: IntoNeighborsDirected,
    F: FilterNode<G::NodeId>, 
[src]

type NeighborsDirected = NodeFilteredNeighbors<'a, G::NeighborsDirected, F>

impl<'a, G, F> IntoNodeIdentifiers for &'a NodeFiltered<G, F> where
    G: IntoNodeIdentifiers,
    F: FilterNode<G::NodeId>, 
[src]

impl<'a, G, F> IntoNodeReferences for &'a NodeFiltered<G, F> where
    G: IntoNodeReferences,
    F: FilterNode<G::NodeId>, 
[src]

impl<G, F> NodeIndexable for NodeFiltered<G, F> where
    G: NodeIndexable
[src]

impl<G, F> Visitable for NodeFiltered<G, F> where
    G: Visitable
[src]

type Map = G::Map

The associated map type

Auto Trait Implementations

impl<G, F> RefUnwindSafe for NodeFiltered<G, F> where
    F: RefUnwindSafe,
    G: RefUnwindSafe

impl<G, F> Send for NodeFiltered<G, F> where
    F: Send,
    G: Send

impl<G, F> Sync for NodeFiltered<G, F> where
    F: Sync,
    G: Sync

impl<G, F> Unpin for NodeFiltered<G, F> where
    F: Unpin,
    G: Unpin

impl<G, F> UnwindSafe for NodeFiltered<G, F> where
    F: UnwindSafe,
    G: UnwindSafe

Blanket Implementations

impl<T> Any for T where
    T: 'static + ?Sized
[src]

impl<T> Borrow<T> for T where
    T: ?Sized
[src]

impl<T> BorrowMut<T> for T where
    T: ?Sized
[src]

impl<T> From<T> for T[src]

impl<T, U> Into<U> for T where
    U: From<T>, 
[src]

impl<T> ToOwned for T where
    T: Clone
[src]

type Owned = T

The resulting type after obtaining ownership.

impl<T, U> TryFrom<U> for T where
    U: Into<T>, 
[src]

type Error = Infallible

The type returned in the event of a conversion error.

impl<T, U> TryInto<U> for T where
    U: TryFrom<T>, 
[src]

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.