Package org.apache.cayenne.ashwood.graph

# Class IndegreeTopologicalSort<E>

java.lang.Object
org.apache.cayenne.ashwood.graph.IndegreeTopologicalSort<E>

All Implemented Interfaces:
  `Iterator<E>`

public class IndegreeTopologicalSort<E> extends Object implements Iterator<E>

Since:
  3.1

- ## Constructor Summary

  Constructors
  Constructor
  Description
  `IndegreeTopologicalSort(Digraph<E,?> digraph)`

- ## Method Summary

  Modifier and Type
  Method
  Description
  `boolean`
  `hasNext()`
  `E`
  `next()`
  `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

  - ### IndegreeTopologicalSort

    public IndegreeTopologicalSort(Digraph<E,?> digraph)

- ## Method Details

  - ### hasNext

    public boolean hasNext()
    Specified by:
      `hasNext` in interface `Iterator<E>`

  - ### next

    public E next()
    Specified by:
      `next` in interface `Iterator<E>`

  - ### remove

    public void remove()
    Specified by:
      `remove` in interface `Iterator<E>`