pub fn edges_directed(&self, a: NodeIndex, dir: Direction) -> Edges<E> {
        Edges {
            skip_start: a,
            edges: &self.edges,
            direction: dir,
            next: match self.nodes.get(a.index()) {
                None => [EdgeIndex::end(), EdgeIndex::end()],
                Some(n) => n.next,
            },
        }
    }
/// Return an iterator of all edges of `a`, in the specified direction.
///
/// - `Directed`, `Outgoing`: All edges from `a`.
/// - `Directed`, `Incoming`: All edges to `a`.
/// - `Undirected`, `Outgoing`: All edges connected to `a`, with `a` being the source of each
///   edge.
/// - `Undirected`, `Incoming`: All edges connected to `a`, with `a` being the target of each
///   edge.
///
/// Produces an empty iterator if the node `a` doesn't exist.<br>
/// Iterator element type is `EdgeReference<E, Ix>`.
Return an iterator of all edges of `a`, in the specified direction.

Produces an empty iterator if the node `a` doesn't exist.
Iterator element type is `EdgeReference`.
Return an iterator of all edges of ` a ` in the specified direction . Produces an empty iterator if the node ` a ` doesn ' t exist . Iterator element type is ` EdgeReference ` .
pub fn edges_directed(&self, a: NodeIndex, dir: Direction) -> Edges<E> {
        Edges {
            skip_start: a,
            edges: &self.edges,
            direction: dir,
            next: match self.nodes.get(a.index()) {
                None => [EdgeIndex::end(), EdgeIndex::end()],
                Some(n) => n.next,
            },
        }
    }
pub fn edges_directed ( & self , a : NodeIndex , dir : Direction ) -> Edges < E > { Edges { skip_start : a , edges : & self . edges , direction : dir , next : match self . nodes . get ( a . index ( ) ) { None => [ EdgeIndex :: end ( ) , EdgeIndex :: end ( ) ] , Some ( n ) => n . next , } , } }
Return an iterator of all edges of `a`, in the specified direction.
Return an iterator of all edges of ` a ` in the specified direction .
&self
a
NodeIndex
dir
Direction