src/main/java/de/dfki/lt/loot/digraph/DiGraph.java
public void removeVertexLazy(int vertex) {
    _outEdges.set(vertex, null);
    // register this vertex as being deleted
    _deletedVertices.set(vertex);

    // clear the entries in the registered property maps
    for(VertexPropertyMap<?> map : _vertexPropertyMaps.values()) {
      map.remove(vertex);
    }

    // clear the entries in the registered boolean property maps
    for(BitSet map : _vertexBooleanPropertyMaps.values()) {
      map.clear(vertex);
    }
  }
/** This removes the given vertex from this directed graph. This does not
   *  delete edges, so either the calling code does take care of the edges,
   *  or a call to cleanup() should be done when a set of vertices was removed.
   *
   *  This code should *always* run when a (non-deleted) vertex is removed
   *  from this directed graph.
   *
   * @param vertex the vertex to remove from the graph
   */
This removes the given vertex from this directed graph. This does not
delete edges, so either the calling code does take care of the edges,
or a call to cleanup() should be done when a set of vertices was removed.

This code should *always* run when a (non-deleted) vertex is removed
from this directed graph.

@param vertex the vertex to remove from the graph
This removes the given vertex from this directed graph . This does not delete edges so either the calling code does take care of the edges or a call to cleanup () should be done when a set of vertices was removed . This code should * always * run when a ( non - deleted ) vertex is removed from this directed graph . @param vertex the vertex to remove from the graph
public void removeVertexLazy(int vertex) {
    _outEdges.set(vertex, null);
    _deletedVertices.set(vertex);
    for(VertexPropertyMap<?> map : _vertexPropertyMaps.values()) {
      map.remove(vertex);
    }
    for(BitSet map : _vertexBooleanPropertyMaps.values()) {
      map.clear(vertex);
    }
  }
public void removeVertexLazy ( int vertex ) { _outEdges . set ( vertex , null ) ; _deletedVertices . set ( vertex ) ; for ( VertexPropertyMap < ? > map : _vertexPropertyMaps . values ( ) ) { map . remove ( vertex ) ; } for ( BitSet map : _vertexBooleanPropertyMaps . values ( ) ) { map . clear ( vertex ) ; } }
This removes the given vertex from this directed graph.
This removes the given vertex from this directed graph .
// register this vertex as being deleted // clear the entries in the registered property maps // clear the entries in the registered boolean property maps