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.
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.
Contains traversal parameter definitions such as direction constants.