src/main/java/de/dfki/lt/loot/digraph/DiGraph.java
public Iterable<Integer> topoSort() throws CyclicGraphException {
	TopoOrderVisitor<EI> topoVisitor = new TopoOrderVisitor<>();
	dfs(topoVisitor);
    return topoVisitor.getSortedVertices();
  }
/** Returns the vertices in topological order, in case there are no cycles,
   *  otherwise throws a CyclicGraphException.
   *  @throws CyclicGraphException if the graph is cyclic
   */
Returns the vertices in topological order, in case there are no cycles,
otherwise throws a CyclicGraphException.
@throws CyclicGraphException if the graph is cyclic
Returns the vertices in topological order in case there are no cycles otherwise throws a CyclicGraphException . @throws CyclicGraphException if the graph is cyclic
public Iterable<Integer> topoSort() throws CyclicGraphException {
	TopoOrderVisitor<EI> topoVisitor = new TopoOrderVisitor<>();
	dfs(topoVisitor);
    return topoVisitor.getSortedVertices();
  }
public Iterable < Integer > topoSort ( ) throws CyclicGraphException { TopoOrderVisitor < EI > topoVisitor = new TopoOrderVisitor < > ( ) ; dfs ( topoVisitor ) ; return topoVisitor . getSortedVertices ( ) ; }
Returns the vertices in topological order, in case there are no cycles,
  otherwise throws a CyclicGraphException.
Returns the vertices in topological order in case there are no cycles otherwise throws a CyclicGraphException .