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

Packages that use GraphTraversalVisitor

Package	Description
net.automatalib.util.graphs.traversal

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

Classes in net.automatalib.util.graphs.traversal that implement GraphTraversalVisitor

Modifier and Type	Class and Description
class	DefaultGraphTraversalVisitor<N,E,D>

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

Modifier and Type	Method and Description
static <N,E,D> boolean	GraphTraversal.breadthFirst(IndefiniteGraph<N,E> graph, Collection<? extends N> initialNodes, GraphTraversalVisitor<N,E,D> visitor)
static <N,E,D> boolean	GraphTraversal.breadthFirst(IndefiniteGraph<N,E> graph, int limit, Collection<? extends N> initialNodes, GraphTraversalVisitor<N,E,D> vis)
static <N,E,D> boolean	GraphTraversal.breadthFirst(IndefiniteGraph<N,E> graph, int limit, N initialNode, GraphTraversalVisitor<N,E,D> visitor)
static <N,E,D> boolean	GraphTraversal.breadthFirst(IndefiniteGraph<N,E> graph, N initialNode, GraphTraversalVisitor<N,E,D> visitor)
static <N,E,D> boolean	GraphTraversal.depthFirst(IndefiniteGraph<N,E> graph, Collection<? extends N> initialNodes, GraphTraversalVisitor<N,E,D> vis)
static <N,E,D> boolean	GraphTraversal.depthFirst(IndefiniteGraph<N,E> graph, int limit, Collection<? extends N> initialNodes, GraphTraversalVisitor<N,E,D> vis)
static <N,E,D> boolean	GraphTraversal.depthFirst(IndefiniteGraph<N,E> graph, int limit, N initNode, GraphTraversalVisitor<N,E,D> vis)
static <N,E,D> boolean	GraphTraversal.depthFirst(IndefiniteGraph<N,E> graph, N initNode, GraphTraversalVisitor<N,E,D> vis)
static <N,E,D> boolean	GraphTraversal.traverse(TraversalOrder order, IndefiniteGraph<N,E> graph, Collection<? extends N> initialNodes, GraphTraversalVisitor<N,E,D> vis)
static <N,E,D> boolean	GraphTraversal.traverse(TraversalOrder order, IndefiniteGraph<N,E> graph, int limit, Collection<? extends N> initialNodes, GraphTraversalVisitor<N,E,D> vis)
static <N,E,D> boolean	GraphTraversal.traverse(TraversalOrder order, IndefiniteGraph<N,E> graph, int limit, N initialNode, GraphTraversalVisitor<N,E,D> vis)
static <N,E,D> boolean	GraphTraversal.traverse(TraversalOrder order, IndefiniteGraph<N,E> graph, N initialNode, GraphTraversalVisitor<N,E,D> vis)