org.apache.cayenne.ashwood.graph
Class IndegreeTopologicalSort<E>

java.lang.Object
  extended by org.apache.cayenne.ashwood.graph.IndegreeTopologicalSort<E>
All Implemented Interfaces:
java.util.Iterator<E>

public class IndegreeTopologicalSort<E>
extends java.lang.Object
implements java.util.Iterator<E>

Since:
3.1

Constructor Summary
IndegreeTopologicalSort(Digraph<E,?> digraph)
           
 
Method Summary
 boolean hasNext()
           
 E next()
           
 void remove()
           
 
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
 

Constructor Detail

IndegreeTopologicalSort

public IndegreeTopologicalSort(Digraph<E,?> digraph)
Method Detail

hasNext

public boolean hasNext()
Specified by:
hasNext in interface java.util.Iterator<E>

next

public E next()
Specified by:
next in interface java.util.Iterator<E>

remove

public void remove()
Specified by:
remove in interface java.util.Iterator<E>


Copyright © 2001-2012 Apache Cayenne. All Rights Reserved.