Trait petgraph::visit::GraphProp

pub trait GraphProp: GraphBase {
    type EdgeType: EdgeType;

    fn is_directed(&self) -> bool { ... }
}

Edge kind property (directed or undirected edges)

Required Associated Types

type EdgeType: EdgeType

The kind edges in the graph.

Provided Methods

fn is_directed(&self) -> bool

Implementations on Foreign Types

impl<'a, G> GraphProp for &'a G where
    G: GraphProp, 

type EdgeType = <G as GraphProp>::EdgeType

Implementors

impl<'a, G> GraphProp for Frozen<'a, G> where
    G: GraphProp, 

type EdgeType = <G as GraphProp>::EdgeType

impl<E, Ix: IndexType> GraphProp for List<E, Ix>

type EdgeType = Directed

impl<G> GraphProp for Reversed<G> where
    G: GraphProp, 

type EdgeType = <G as GraphProp>::EdgeType

impl<G, F> GraphProp for EdgeFiltered<G, F> where
    G: GraphProp, 

type EdgeType = <G as GraphProp>::EdgeType

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

type EdgeType = <G as GraphProp>::EdgeType

impl<N, E, Ty> GraphProp for GraphMap<N, E, Ty> where
    N: NodeTrait,
    Ty: EdgeType, 

type EdgeType = Ty

impl<N, E, Ty, Ix> GraphProp for Csr<N, E, Ty, Ix> where
    Ty: EdgeType,
    Ix: IndexType, 

type EdgeType = Ty

impl<N, E, Ty, Ix> GraphProp for Graph<N, E, Ty, Ix> where
    Ty: EdgeType,
    Ix: IndexType, 

type EdgeType = Ty

impl<N, E, Ty, Ix> GraphProp for StableGraph<N, E, Ty, Ix> where
    Ty: EdgeType,
    Ix: IndexType, 

type EdgeType = Ty

impl<N, E, Ty: EdgeType, Null: Nullable<Wrapped = E>, Ix: IndexType> GraphProp for MatrixGraph<N, E, Ty, Null, Ix>

type EdgeType = Ty