Struct Walk 

pub struct Walk<'a, N> { /* private fields */ }

A walk standing on a set of nodes of one type.

Each hop is a whole frontier at a time, and the frontier is a set, so a diamond in the graph does not turn into two copies of the node at the far end. See Graph::walk.

Implementations

impl<'a, N: Node> Walk<'a, N>

pub fn out<E: Edge<From = N>>(self) -> Result<Walk<'a, E::To>>

Follow every edge of this kind forwards.

E::From is N, which is what makes a hop the graph does not have a compile error rather than an empty answer.

Errors

Code::Invalid if called from inside a callback holding this database.

pub fn incoming<E: Edge<To = N>>(self) -> Result<Walk<'a, E::From>>

Follow every edge of this kind backwards.

Errors

Code::Invalid if called from inside a callback holding this database.

pub fn filter(self, keep: impl FnMut(&N) -> bool) -> Result<Walk<'a, N>>

Keep only the nodes that pass.

The node is read to be looked at, so this is the expensive filter and it belongs at the end of a walk rather than in the middle of one.

Errors

Code::Corrupt if a node on the walk is not an N.

pub fn len(&self) -> usize

How many nodes the walk is standing on.

pub fn is_empty(&self) -> bool

Whether the walk reached nothing.

pub fn ids(self) -> Vec<Id<N>>

The nodes the walk reached, as handles.

pub fn nodes(self) -> Result<Vec<N>>

The nodes the walk reached, read out.

A probe per node, which is what 11 section 4 prices this at and the reason it is a separate call rather than what a hop hands back.

Errors

Code::Corrupt if a node on the walk is not an N.

Trait Implementations

impl<N: Node> Debug for Walk<'_, N>

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

Formats the value using the given formatter.