Struct EdgeId 

pub struct EdgeId<E> { /* private fields */ }

One edge in a graph, which is what Graph::link answers with.

Two edges of the same kind between the same pair are two edges, so this names one of them and reading an edge’s fields needs it.

Trait Implementations

impl<E> Clone for EdgeId<E>

fn clone(&self) -> EdgeId<E>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<E> Copy for EdgeId<E>

impl<E: Edge> Debug for EdgeId<E>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<E> Eq for EdgeId<E>

impl<E> PartialEq for EdgeId<E>

fn eq(&self, other: &EdgeId<E>) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.