org.apache.calcite.util.graph

Class DepthFirstIterator<V,E extends DefaultEdge>

java.lang.Object

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

Type Parameters:

V - Vertex type

E - Edge type

All Implemented Interfaces:

Iterator<V>

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

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

Field Summary

Fields

Modifier and Type	Field and Description
private Iterator<V>	iterator

Constructor Summary

Constructors

Constructor and Description
DepthFirstIterator(DirectedGraph<V,E> graph, V start)

Method Summary

Modifier and Type	Method and Description
private static <V,E extends DefaultEdge> List<V>	buildList(DirectedGraph<V,E> graph, V start)
private static <V,E extends DefaultEdge> void	buildListRecurse(Collection<V> list, Set<V> activeVertices, DirectedGraph<V,E> graph, V start)
boolean	hasNext()
V	next()
static <V,E extends DefaultEdge> Iterable<V>	of(DirectedGraph<V,E> graph, V start) Creates an iterable over the vertices in the given graph in a depth-first iteration order.
static <V,E extends DefaultEdge> void	reachable(Collection<V> list, DirectedGraph<V,E> graph, V start) Populates a collection 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

Methods inherited from interface java.util.Iterator

forEachRemaining

Field Detail

iterator

private final Iterator<V> iterator

Constructor Detail

DepthFirstIterator

public DepthFirstIterator(DirectedGraph<V,E> graph,
                          V start)

Method Detail

buildList

private static <V,E extends DefaultEdge> List<V> buildList(DirectedGraph<V,E> graph,
                                                           V start)

of

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

Creates an iterable over the vertices in the given graph in a depth-first iteration order.

reachable

public static <V,E extends DefaultEdge> void reachable(Collection<V> list,
                                                       DirectedGraph<V,E> graph,
                                                       V start)

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

buildListRecurse

private static <V,E extends DefaultEdge> void buildListRecurse(Collection<V> list,
                                                               Set<V> activeVertices,
                                                               DirectedGraph<V,E> graph,
                                                               V start)

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>