public abstract class GraphTraversal extends Object
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) |
public static <N,E,D> boolean traverse(TraversalOrder order, IndefiniteGraph<N,E> graph, int limit, Collection<? extends N> initialNodes, GraphTraversalVisitor<N,E,D> vis)
public static <N,E,D> boolean traverse(TraversalOrder order, IndefiniteGraph<N,E> graph, int limit, N initialNode, GraphTraversalVisitor<N,E,D> vis)
public static <N,E,D> boolean traverse(TraversalOrder order, IndefiniteGraph<N,E> graph, N initialNode, GraphTraversalVisitor<N,E,D> vis)
public static <N,E,D> boolean traverse(TraversalOrder order, IndefiniteGraph<N,E> graph, Collection<? extends N> initialNodes, GraphTraversalVisitor<N,E,D> vis)
public static <N,E,D> boolean breadthFirst(IndefiniteGraph<N,E> graph, int limit, Collection<? extends N> initialNodes, GraphTraversalVisitor<N,E,D> vis)
public static <N,E,D> boolean breadthFirst(IndefiniteGraph<N,E> graph, int limit, N initialNode, GraphTraversalVisitor<N,E,D> visitor)
public static <N,E,D> boolean breadthFirst(IndefiniteGraph<N,E> graph, Collection<? extends N> initialNodes, GraphTraversalVisitor<N,E,D> visitor)
public static <N,E,D> boolean breadthFirst(IndefiniteGraph<N,E> graph, N initialNode, GraphTraversalVisitor<N,E,D> visitor)
public static <N,E,D> boolean depthFirst(IndefiniteGraph<N,E> graph, int limit, Collection<? extends N> initialNodes, GraphTraversalVisitor<N,E,D> vis)
public static <N,E,D> boolean depthFirst(IndefiniteGraph<N,E> graph, N initNode, GraphTraversalVisitor<N,E,D> vis)
public static <N,E,D> boolean depthFirst(IndefiniteGraph<N,E> graph, int limit, N initNode, GraphTraversalVisitor<N,E,D> vis)
public static <N,E,D> boolean depthFirst(IndefiniteGraph<N,E> graph, Collection<? extends N> initialNodes, GraphTraversalVisitor<N,E,D> vis)
public static <N,E,D> boolean dfs(IndefiniteGraph<N,E> graph, int limit, Collection<? extends N> initialNodes, DFSVisitor<? super N,? super E,D> visitor)
public static <N,E,D> boolean dfs(IndefiniteGraph<N,E> graph, N initialNode, DFSVisitor<? super N,? super E,D> visitor)
public static <N,E,D> boolean dfs(IndefiniteGraph<N,E> graph, Collection<? extends N> initialNodes, DFSVisitor<? super N,? super E,D> visitor)
public static <N,E> Iterator<N> bfIterator(IndefiniteGraph<N,E> graph, Collection<? extends N> start)
public static <N,E> Iterable<N> breadthFirstOrder(IndefiniteGraph<N,E> graph, Collection<? extends N> start)
public static <N,E> Iterator<N> dfIterator(IndefiniteGraph<N,E> graph, Collection<? extends N> start)
public static <N,E> Iterable<N> depthFirstOrder(IndefiniteGraph<N,E> graph, Collection<? extends N> start)
Copyright © 2015. All rights reserved.