src/main/java/de/dfki/lt/loot/digraph/DiGraph.java
@Deprecated
  public void removeVertex(int vertex) {
    if (isVertex(vertex)) {
      removeVertexLazy(vertex);
      cleanupEdges();
    }
  }
/** This removes the given vertex from this directed graph. This is not a lazy
   * implementation and therefore quite expensive (up to O(E)).
   *
   * @deprecated
   *
   * Don't use this function regularly. If this is necessary, use a
   * {@link DirectedBiGraph} instead
   *
   * @param vertex the vertex to remove from the graph
   */
This removes the given vertex from this directed graph. This is not a lazy
implementation and therefore quite expensive (up to O(E)).

@deprecated

Don't use this function regularly. If this is necessary, use a
DirectedBiGraph instead

@param vertex the vertex to remove from the graph
This removes the given vertex from this directed graph . This is not a lazy implementation and therefore quite expensive ( up to O ( E )) . @deprecated Don ' t use this function regularly . If this is necessary use a DirectedBiGraph instead @param vertex the vertex to remove from the graph
@Deprecated
  public void removeVertex(int vertex) {
    if (isVertex(vertex)) {
      removeVertexLazy(vertex);
      cleanupEdges();
    }
  }
@ Deprecated public void removeVertex ( int vertex ) { if ( isVertex ( vertex ) ) { removeVertexLazy ( vertex ) ; cleanupEdges ( ) ; } }
This removes the given vertex from this directed graph.
This removes the given vertex from this directed graph .