Struct petgraph::visit::EdgeFiltered [] [src]

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

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.

Methods

impl<F, G> EdgeFiltered<G, F> where
    G: IntoEdgeReferences,
    F: Fn(G::EdgeRef) -> bool
[src]

[src]

Create an EdgeFiltered adaptor from the closure filter.

Trait Implementations

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

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

[src]

Returns a copy of the value. Read more

1.0.0
[src]

Performs copy-assignment from source. Read more

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

[src]

Formats the value using the given formatter. Read more

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

node identifier

edge identifier

impl<'a, G, F> IntoNeighbors for &'a EdgeFiltered<G, F> where
    G: IntoEdges,
    F: FilterEdge<G::EdgeRef>, 
[src]

[src]

Return an iterator of the neighbors of node a.

impl<'a, G, F> IntoEdgeReferences for &'a EdgeFiltered<G, F> where
    G: IntoEdgeReferences,
    F: FilterEdge<G::EdgeRef>, 
[src]

[src]

impl<'a, G, F> IntoEdges for &'a EdgeFiltered<G, F> where
    G: IntoEdges,
    F: FilterEdge<G::EdgeRef>, 
[src]

[src]

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

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

The kind edges in the graph.

[src]

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

[src]

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

[src]

impl<G, F> NodeCompactIndexable for EdgeFiltered<G, F> where
    G: NodeCompactIndexable
[src]

impl<G, F> NodeCount for EdgeFiltered<G, F> where
    G: NodeCount
[src]

[src]

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

[src]

Return an upper bound of the node indices in the graph (suitable for the size of a bitmap). Read more

[src]

Convert a to an integer index.

[src]

Convert i to a node index

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

The associated map type

[src]

Create a new visitor map

[src]

Reset the visitor map (and resize to new size of graph if needed)