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) |