src/main/java/de/dfki/lt/loot/digraph/DiGraph.java
public List<Integer> findSinks() {
	  List<Integer> result = new ArrayList<>();
	  for(int vertex = 0; vertex < getNumberOfVertices(); ++vertex) {
		  if (! isDeletedVertex(vertex) &&
				  this._outEdges.get(vertex).isEmpty()) {
			  result.add(vertex);
		  }
	  }
	  return result; 
  }
/** Return all nodes that have no outgoing edges (complexity O(V)) */
Return all nodes that have no outgoing edges (complexity O(V))
Return all nodes that have no outgoing edges ( complexity O ( V ))
public List<Integer> findSinks() {
	  List<Integer> result = new ArrayList<>();
	  for(int vertex = 0; vertex < getNumberOfVertices(); ++vertex) {
		  if (! isDeletedVertex(vertex) &&
				  this._outEdges.get(vertex).isEmpty()) {
			  result.add(vertex);
		  }
	  }
	  return result; 
  }
public List < Integer > findSinks ( ) { List < Integer > result = new ArrayList < > ( ) ; for ( int vertex = 0 ; vertex < getNumberOfVertices ( ) ; ++ vertex ) { if ( ! isDeletedVertex ( vertex ) && this . _outEdges . get ( vertex ) . isEmpty ( ) ) { result . add ( vertex ) ; } } return result ; }
Return all nodes that have no outgoing edges (complexity O(V))
Return all nodes that have no outgoing edges ( complexity O ( V ))