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.

Field Summary

Fields

Modifier and Type	Field and Description
(package private) Map<V,int[]>	countMap
(package private) List<V>	empties
private DefaultDirectedGraph<V,E>	graph

Constructor Summary

Constructors

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

Method Summary

Modifier and Type	Method and Description
(package private) Set<V>	findCycles()
boolean	hasNext()
V	next()
static <V,E extends DefaultEdge> Iterable<V>	of(DirectedGraph<V,E> graph)
private void	populate(Map<V,int[]> countMap, List<V> empties)
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

countMap

final Map<V,int[]> countMap

empties

final List<V> empties

graph

private final DefaultDirectedGraph<V,E extends DefaultEdge> graph

Constructor Detail

TopologicalOrderIterator

public TopologicalOrderIterator(DirectedGraph<V,E> graph)

Method Detail

of

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

populate

private void populate(Map<V,int[]> countMap,
                      List<V> empties)

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>

findCycles

Set<V> findCycles()