Home
last modified time | relevance | path

Searched refs:startNodes (Results 1 – 2 of 2) sorted by relevance

/external/guava/guava/src/com/google/common/graph/
DTraverser.java223 public abstract Iterable<N> breadthFirst(Iterable<? extends N> startNodes); in breadthFirst() argument
268 public abstract Iterable<N> depthFirstPreOrder(Iterable<? extends N> startNodes); in depthFirstPreOrder() argument
313 public abstract Iterable<N> depthFirstPostOrder(Iterable<? extends N> startNodes); in depthFirstPostOrder() argument
332 public Iterable<N> breadthFirst(final Iterable<? extends N> startNodes) { in breadthFirst() argument
333 checkNotNull(startNodes); in breadthFirst()
334 if (Iterables.isEmpty(startNodes)) { in breadthFirst()
337 for (N startNode : startNodes) { in breadthFirst()
343 return new BreadthFirstIterator(startNodes); in breadthFirst()
355 public Iterable<N> depthFirstPreOrder(final Iterable<? extends N> startNodes) { in depthFirstPreOrder() argument
356 checkNotNull(startNodes); in depthFirstPreOrder()
[all …]
/external/guava/android/guava/src/com/google/common/graph/
DTraverser.java223 public abstract Iterable<N> breadthFirst(Iterable<? extends N> startNodes); in breadthFirst() argument
268 public abstract Iterable<N> depthFirstPreOrder(Iterable<? extends N> startNodes); in depthFirstPreOrder() argument
313 public abstract Iterable<N> depthFirstPostOrder(Iterable<? extends N> startNodes); in depthFirstPostOrder() argument
332 public Iterable<N> breadthFirst(final Iterable<? extends N> startNodes) { in breadthFirst() argument
333 checkNotNull(startNodes); in breadthFirst()
334 if (Iterables.isEmpty(startNodes)) { in breadthFirst()
337 for (N startNode : startNodes) { in breadthFirst()
343 return new BreadthFirstIterator(startNodes); in breadthFirst()
355 public Iterable<N> depthFirstPreOrder(final Iterable<? extends N> startNodes) { in depthFirstPreOrder() argument
356 checkNotNull(startNodes); in depthFirstPreOrder()
[all …]