Algebraic type to determine which connected nodes the traversal has to follow.
Algebraic type for the kind of traversal.
Marker trait for informers aimed at passing algorithmic-specific state to scalax.collection.GraphTraversal.ExtendedNodeVisitor.
Parameters to control traversals.
The kind of traversal including breadth-first and depth-fist search.
Determines which connected nodes the traversal has to follow.
The default value is
A positive value to limit the number of layers for BFS respectively
the number of consecutive child visits before siblings are visited for DFS.
0 - the default - indicates that the traversal should have
an unlimited depth.
Defines the traversal to follow successor and predecessor nodes alike.
Instructs the traverser to use a breadth first search (BSF, search layer-for-layer).
Instructs the traverser to use a depth first search (DFS).
Defines the traversal to follow predecessor nodes.
Defines the traversal to follow successor nodes.
Implements an empty visitor based on a value.