Uses of Interface
net.automatalib.util.graph.traversal.GraphTraversalVisitor

Packages that use GraphTraversalVisitor

Package	Description
net.automatalib.util.graph.scc
net.automatalib.util.graph.traversal

Uses of GraphTraversalVisitor in net.automatalib.util.graph.scc

Classes in net.automatalib.util.graph.scc that implement GraphTraversalVisitor

Modifier and Type	Class	Description
class	TarjanSCCVisitor<N,E>	Depth-first traversal visitor realizing Tarjan's algorithm for finding all strongly-connected components (SCCs) in a graph.

Uses of GraphTraversalVisitor in net.automatalib.util.graph.traversal

Methods in net.automatalib.util.graph.traversal with parameters of type GraphTraversalVisitor

Modifier and Type	Method	Description
static <N,E,D> boolean	GraphTraversal.breadthFirst(IndefiniteGraph<N,E> graph, int limit, Collection<? extends N> initialNodes, GraphTraversalVisitor<N,E,D> visitor)	Traverses the given graph in a breadth-first fashion.
static <N,E,D> boolean	GraphTraversal.breadthFirst(IndefiniteGraph<N,E> graph, int limit, N initialNode, GraphTraversalVisitor<N,E,D> visitor)	Traverses the given graph in a breadth-first fashion.
static <N,E,D> void	GraphTraversal.breadthFirst(IndefiniteGraph<N,E> graph, Collection<? extends N> initialNodes, GraphTraversalVisitor<N,E,D> visitor)	Traverses the given graph in a breadth-first fashion.
static <N,E,D> void	GraphTraversal.breadthFirst(IndefiniteGraph<N,E> graph, N initialNode, GraphTraversalVisitor<N,E,D> visitor)	Traverses the given graph in a breadth-first fashion.
static <N,E,D> boolean	GraphTraversal.depthFirst(IndefiniteGraph<N,E> graph, int limit, Collection<? extends N> initialNodes, GraphTraversalVisitor<N,E,D> visitor)	Traverses the given graph in a breadth-first fashion.
static <N,E,D> boolean	GraphTraversal.depthFirst(IndefiniteGraph<N,E> graph, int limit, N initialNode, GraphTraversalVisitor<N,E,D> visitor)	Traverses the given graph in a depth-first fashion.
static <N,E,D> void	GraphTraversal.depthFirst(IndefiniteGraph<N,E> graph, Collection<? extends N> initialNodes, GraphTraversalVisitor<N,E,D> visitor)	Traverses the given graph in a depth-first fashion.
static <N,E,D> void	GraphTraversal.depthFirst(IndefiniteGraph<N,E> graph, N initialNode, GraphTraversalVisitor<N,E,D> visitor)	Traverses the given graph in a depth-first fashion.
static <N,E,D> boolean	GraphTraversal.traverse(TraversalOrder order, IndefiniteGraph<N,E> graph, int limit, Collection<? extends N> initialNodes, GraphTraversalVisitor<N,E,D> visitor)	Traverses the given graph in a given order.
static <N,E,D> boolean	GraphTraversal.traverse(TraversalOrder order, IndefiniteGraph<N,E> graph, int limit, N initialNode, GraphTraversalVisitor<N,E,D> visitor)	Traverses the given graph in a given order.
static <N,E,D> void	GraphTraversal.traverse(TraversalOrder order, IndefiniteGraph<N,E> graph, Collection<? extends N> initialNodes, GraphTraversalVisitor<N,E,D> visitor)	Traverses the given graph in a given order.
static <N,E,D> void	GraphTraversal.traverse(TraversalOrder order, IndefiniteGraph<N,E> graph, N initialNode, GraphTraversalVisitor<N,E,D> visitor)	Traverses the given graph in a given order.