Struct Hop 

pub struct Hop<E: Edge> {
    pub to: Id<E::To>,
    pub edge: EdgeId<E>,
}

One step across an edge: where it went, and which edge it was.

A pair with names on it rather than a tuple, because the whole point of the second half is that reading the edge’s fields needs a handle and a caller should not have to remember which end of a tuple that is.

Fields

to: Id<E::To>

The node at the far end.

edge: EdgeId<E>

The edge that got there, which Graph::edge reads.

Trait Implementations

impl<E: Edge> Clone for Hop<E>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<E: Edge> Copy for Hop<E>

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

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

Formats the value using the given formatter.