V
- Vertex typeE
- Edge typepublic class BreadthFirstIterator<V,E extends DefaultEdge>
extends java.lang.Object
implements java.util.Iterator<V>
Modifier and Type | Field and Description |
---|---|
private java.util.Deque<V> |
deque |
private DirectedGraph<V,E> |
graph |
private java.util.Set<V> |
set |
Constructor and Description |
---|
BreadthFirstIterator(DirectedGraph<V,E> graph,
V root) |
Modifier and Type | Method and Description |
---|---|
boolean |
hasNext() |
V |
next() |
static <V,E extends DefaultEdge> |
of(DirectedGraph<V,E> graph,
V root) |
static <V,E extends DefaultEdge> |
reachable(java.util.Set<V> set,
DirectedGraph<V,E> graph,
V root)
Populates a set with the nodes reachable from a given node.
|
void |
remove() |
private final DirectedGraph<V,E extends DefaultEdge> graph
private final java.util.Deque<V> deque
private final java.util.Set<V> set
public BreadthFirstIterator(DirectedGraph<V,E> graph, V root)
public static <V,E extends DefaultEdge> java.lang.Iterable<V> of(DirectedGraph<V,E> graph, V root)
public static <V,E extends DefaultEdge> void reachable(java.util.Set<V> set, DirectedGraph<V,E> graph, V root)
public boolean hasNext()
hasNext
in interface java.util.Iterator<V>
public void remove()
remove
in interface java.util.Iterator<V>
Copyright © 2012–2019 The Apache Software Foundation. All rights reserved.