net.automatalib.util.graphs.traversal

Class GraphTraversal

java.lang.Object

net.automatalib.util.graphs.traversal.GraphTraversal

public final class GraphTraversal
extends Object

Method Summary

Modifier and Type	Method and Description
static <N,E> Iterator<N>	bfIterator(IndefiniteGraph<N,E> graph, Collection<? extends N> start)
static <N,E,D> boolean	breadthFirst(IndefiniteGraph<N,E> graph, Collection<? extends N> initialNodes, GraphTraversalVisitor<N,E,D> visitor)
static <N,E,D> boolean	breadthFirst(IndefiniteGraph<N,E> graph, int limit, Collection<? extends N> initialNodes, GraphTraversalVisitor<N,E,D> vis)
static <N,E,D> boolean	breadthFirst(IndefiniteGraph<N,E> graph, int limit, N initialNode, GraphTraversalVisitor<N,E,D> visitor)
static <N,E,D> boolean	breadthFirst(IndefiniteGraph<N,E> graph, N initialNode, GraphTraversalVisitor<N,E,D> visitor)
static <N,E> Iterable<N>	breadthFirstOrder(IndefiniteGraph<N,E> graph, Collection<? extends N> start)
static <N,E,D> boolean	depthFirst(IndefiniteGraph<N,E> graph, Collection<? extends N> initialNodes, GraphTraversalVisitor<N,E,D> vis)
static <N,E,D> boolean	depthFirst(IndefiniteGraph<N,E> graph, int limit, Collection<? extends N> initialNodes, GraphTraversalVisitor<N,E,D> vis)
static <N,E,D> boolean	depthFirst(IndefiniteGraph<N,E> graph, int limit, N initNode, GraphTraversalVisitor<N,E,D> vis)
static <N,E,D> boolean	depthFirst(IndefiniteGraph<N,E> graph, N initNode, GraphTraversalVisitor<N,E,D> vis)
static <N,E> Iterable<N>	depthFirstOrder(IndefiniteGraph<N,E> graph, Collection<? extends N> start)
static <N,E> Iterator<N>	dfIterator(IndefiniteGraph<N,E> graph, Collection<? extends N> start)
static <N,E,D> boolean	dfs(IndefiniteGraph<N,E> graph, Collection<? extends N> initialNodes, DFSVisitor<? super N,? super E,D> visitor)
static <N,E,D> boolean	dfs(IndefiniteGraph<N,E> graph, int limit, Collection<? extends N> initialNodes, DFSVisitor<? super N,? super E,D> visitor)
static <N,E,D> boolean	dfs(IndefiniteGraph<N,E> graph, N initialNode, DFSVisitor<? super N,? super E,D> visitor)
static <N,E,D> boolean	traverse(TraversalOrder order, IndefiniteGraph<N,E> graph, Collection<? extends N> initialNodes, GraphTraversalVisitor<N,E,D> vis)
static <N,E,D> boolean	traverse(TraversalOrder order, IndefiniteGraph<N,E> graph, int limit, Collection<? extends N> initialNodes, GraphTraversalVisitor<N,E,D> vis)
static <N,E,D> boolean	traverse(TraversalOrder order, IndefiniteGraph<N,E> graph, int limit, N initialNode, GraphTraversalVisitor<N,E,D> vis)
static <N,E,D> boolean	traverse(TraversalOrder order, IndefiniteGraph<N,E> graph, N initialNode, GraphTraversalVisitor<N,E,D> vis)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Method Detail

traverse

public static <N,E,D> boolean traverse(TraversalOrder order,
                                       IndefiniteGraph<N,E> graph,
                                       int limit,
                                       N initialNode,
                                       GraphTraversalVisitor<N,E,D> vis)

traverse

public static <N,E,D> boolean traverse(TraversalOrder order,
                                       IndefiniteGraph<N,E> graph,
                                       int limit,
                                       Collection<? extends N> initialNodes,
                                       GraphTraversalVisitor<N,E,D> vis)

traverse

public static <N,E,D> boolean traverse(TraversalOrder order,
                                       IndefiniteGraph<N,E> graph,
                                       N initialNode,
                                       GraphTraversalVisitor<N,E,D> vis)

traverse

public static <N,E,D> boolean traverse(TraversalOrder order,
                                       IndefiniteGraph<N,E> graph,
                                       Collection<? extends N> initialNodes,
                                       GraphTraversalVisitor<N,E,D> vis)

depthFirst

public static <N,E,D> boolean depthFirst(IndefiniteGraph<N,E> graph,
                                         int limit,
                                         Collection<? extends N> initialNodes,
                                         GraphTraversalVisitor<N,E,D> vis)

depthFirst

public static <N,E,D> boolean depthFirst(IndefiniteGraph<N,E> graph,
                                         N initNode,
                                         GraphTraversalVisitor<N,E,D> vis)

depthFirst

public static <N,E,D> boolean depthFirst(IndefiniteGraph<N,E> graph,
                                         int limit,
                                         N initNode,
                                         GraphTraversalVisitor<N,E,D> vis)

depthFirst

public static <N,E,D> boolean depthFirst(IndefiniteGraph<N,E> graph,
                                         Collection<? extends N> initialNodes,
                                         GraphTraversalVisitor<N,E,D> vis)

breadthFirst

public static <N,E,D> boolean breadthFirst(IndefiniteGraph<N,E> graph,
                                           int limit,
                                           Collection<? extends N> initialNodes,
                                           GraphTraversalVisitor<N,E,D> vis)

breadthFirst

public static <N,E,D> boolean breadthFirst(IndefiniteGraph<N,E> graph,
                                           int limit,
                                           N initialNode,
                                           GraphTraversalVisitor<N,E,D> visitor)

breadthFirst

public static <N,E,D> boolean breadthFirst(IndefiniteGraph<N,E> graph,
                                           Collection<? extends N> initialNodes,
                                           GraphTraversalVisitor<N,E,D> visitor)

breadthFirst

public static <N,E,D> boolean breadthFirst(IndefiniteGraph<N,E> graph,
                                           N initialNode,
                                           GraphTraversalVisitor<N,E,D> visitor)

dfs

public static <N,E,D> boolean dfs(IndefiniteGraph<N,E> graph,
                                  N initialNode,
                                  DFSVisitor<? super N,? super E,D> visitor)

dfs

public static <N,E,D> boolean dfs(IndefiniteGraph<N,E> graph,
                                  int limit,
                                  Collection<? extends N> initialNodes,
                                  DFSVisitor<? super N,? super E,D> visitor)

dfs

public static <N,E,D> boolean dfs(IndefiniteGraph<N,E> graph,
                                  Collection<? extends N> initialNodes,
                                  DFSVisitor<? super N,? super E,D> visitor)

breadthFirstOrder

public static <N,E> Iterable<N> breadthFirstOrder(IndefiniteGraph<N,E> graph,
                                                  Collection<? extends N> start)

bfIterator

public static <N,E> Iterator<N> bfIterator(IndefiniteGraph<N,E> graph,
                                           Collection<? extends N> start)

depthFirstOrder

public static <N,E> Iterable<N> depthFirstOrder(IndefiniteGraph<N,E> graph,
                                                Collection<? extends N> start)

dfIterator

public static <N,E> Iterator<N> dfIterator(IndefiniteGraph<N,E> graph,
                                           Collection<? extends N> start)