src/main/java/de/dfki/lt/loot/digraph/DiGraph.java
public int newVertex() {
    if (_deletedVertices.isEmpty()) {
      _outEdges.add(null);
      return _outEdges.size() - 1;
    }
    int vertex = _deletedVertices.nextSetBit(0);
    _deletedVertices.clear(vertex);
    return vertex;
  }
/** This creates a new vertex. It either takes an available deleted vertex
   * or creates a completely new one.
   *
   * @return an empty vertex
   */
This creates a new vertex. It either takes an available deleted vertex
or creates a completely new one.

@return an empty vertex
This creates a new vertex . It either takes an available deleted vertex or creates a completely new one . @return an empty vertex
public int newVertex() {
    if (_deletedVertices.isEmpty()) {
      _outEdges.add(null);
      return _outEdges.size() - 1;
    }
    int vertex = _deletedVertices.nextSetBit(0);
    _deletedVertices.clear(vertex);
    return vertex;
  }
public int newVertex ( ) { if ( _deletedVertices . isEmpty ( ) ) { _outEdges . add ( null ) ; return _outEdges . size ( ) - 1 ; } int vertex = _deletedVertices . nextSetBit ( 0 ) ; _deletedVertices . clear ( vertex ) ; return vertex ; }
This creates a new vertex.
This creates a new vertex .