org.apache.calcite.util.graph

Class BreadthFirstIterator<V,E extends DefaultEdge>

java.lang.Object

org.apache.calcite.util.graph.BreadthFirstIterator<V,E>

Type Parameters:

V - Vertex type

E - Edge type

All Implemented Interfaces:

Iterator<V>

public class BreadthFirstIterator<V,E extends DefaultEdge>
extends Object
implements Iterator<V>

Iterates over the vertices in a directed graph in breadth-first order.

Constructor Summary

Constructors

Constructor and Description
BreadthFirstIterator(DirectedGraph<V,E> graph, V root)

Method Summary

Methods

Modifier and Type	Method and Description
boolean	hasNext()
V	next()
static <V,E extends DefaultEdge> Iterable<V>	of(DirectedGraph<V,E> graph, V root)
static <V,E extends DefaultEdge> void	reachable(Set<V> set, DirectedGraph<V,E> graph, V root) Populates a set with the nodes reachable from a given node.
void	remove()

Methods inherited from class java.lang.Object

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

Constructor Detail

BreadthFirstIterator

public BreadthFirstIterator(DirectedGraph<V,E> graph,
                    V root)

Method Detail

of

public static <V,E extends DefaultEdge> Iterable<V> of(DirectedGraph<V,E> graph,
                                       V root)

reachable

public static <V,E extends DefaultEdge> void reachable(Set<V> set,
                                       DirectedGraph<V,E> graph,
                                       V root)

Populates a set with the nodes reachable from a given node.

hasNext

public boolean hasNext()

Specified by:

hasNext in interface Iterator<V>

next

public V next()

Specified by:

next in interface Iterator<V>

remove

public void remove()

Specified by:

remove in interface Iterator<V>