Package org.apache.calcite.util.graph

Class TopologicalOrderIterator<V,E extends DefaultEdge>

java.lang.Object

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

Type Parameters:

V - Vertex type

E - Edge type

All Implemented Interfaces:

Iterator<V>

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

Iterates over the edges of a graph in topological order.

Constructor Summary

Constructors

Constructor	Description
TopologicalOrderIterator(DirectedGraph<V,E> graph)
TopologicalOrderIterator(DirectedGraph<V,E> graph, HepMatchOrder hepMatchOrder)

Method Summary

Modifier and Type	Method	Description
boolean	hasNext()
V	next()
static <V, E extends DefaultEdge> Iterable<V>	of(DirectedGraph<V,E> graph)
static <V, E extends DefaultEdge> Iterable<V>	of(DirectedGraph<V,E> graph, HepMatchOrder hepMatchOrder)
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

Constructor Details

TopologicalOrderIterator

public TopologicalOrderIterator(DirectedGraph<V,E> graph)

TopologicalOrderIterator

public TopologicalOrderIterator(DirectedGraph<V,E> graph,
 HepMatchOrder hepMatchOrder)

Method Details

of

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

of

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

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>