///
/// Begins a Walk from the given roots.
/// The Walk will iterate over all nodes that descend from the roots in the direction of
/// traversal but won't necessarily be in topological order.
///
Begins a Walk from the given roots.
The Walk will iterate over all nodes that descend from the roots in the direction of
traversal but won't necessarily be in topological order.
Begins a Walk from the given roots . The Walk will iterate over all nodes that descend from the roots in the direction of traversal but won ' t necessarily be in topological order .
fn walk<F: Fn(EdgeId) -> bool>(
    &self,
    roots: VecDeque<EntryId>,
    direction: Direction,
    should_walk_edge: F,
  ) -> Walk<'_, N, F> {
    Walk {
      graph: self,
      direction: direction,
      deque: roots,
      walked: HashSet::default(),
      should_walk_edge,
    }
  }
fn walk < F : Fn ( EdgeId ) -> bool > ( & self , roots : VecDeque < EntryId > , direction : Direction , should_walk_edge : F , ) -> Walk < ' _ , N , F > { Walk { graph : self , direction : direction , deque : roots , walked : HashSet :: default ( ) , should_walk_edge , } }
Begins a Walk from the given roots.
Begins a Walk from the given roots .
&self
roots
VecDeque<EntryId>
direction
Direction
should_walk_edge
F