Expand description
Walker is a trait providing a variety of useful methods for traversing graph types.
Structs
Walks the entirety of a before walking the entirety of b.
A walker that repeats its internal walker endlessly.
A walker that applies some given predicate to each element returned by its walker.
A walker that calls a function with a reference to each index pair before yielding them.
A walker that has a .peek(&graph) method that returns an optional next neighbor.
Recursively walks a graph using the recursive function recursive_fn.
A walker that skips the first n steps of this walk, and then yields all further steps.
A walker that invokes the predicate on elements until it returns false.
A walker that yields the first n steps of this walk.
A walker that yields elements so long as the predicate returns true.