Trait EdgeFindable 

pub trait EdgeFindable: Data {
    // Required method
    fn edge_find(
        &self,
        a: Self::NodeId,
        b: Self::NodeId,
    ) -> Option<Self::EdgeId>;
}

A graph that can find edges by a pair of node ids.

Required Methods

fn edge_find(&self, a: Self::NodeId, b: Self::NodeId) -> Option<Self::EdgeId>

Dyn Compatibility

This trait is dyn compatible.

In older versions of Rust, dyn compatibility was called "object safety".

Implementations on Foreign Types

impl<N, E, Ty, Ix> EdgeFindable for &Graph<N, E, Ty, Ix>

where Ty: EdgeType, Ix: IndexType,

fn edge_find(&self, a: Self::NodeId, b: Self::NodeId) -> Option<Self::EdgeId>

impl<N, E, Ty, Ix> EdgeFindable for &StableGraph<N, E, Ty, Ix>

where Ty: EdgeType, Ix: IndexType,

fn edge_find(&self, a: Self::NodeId, b: Self::NodeId) -> Option<Self::EdgeId>

Implementors