src/main/java/de/dfki/lt/loot/digraph/DirectedBiGraph.java
@Override
  public void removeVertex(int vertex) {
    if (isVertex(vertex)) {
      // remove the edges from and to this vertex from other vertices
      // edge lists
      EdgeContainer<EdgeInfo> out = _outEdges.get(vertex);
      if (out != null) {
        for (Edge<EdgeInfo> edge : out) {
          _inEdges.get(edge.getTarget()).removeEdge(edge);
        }
        _outEdges.set(vertex, null);
      }
      EdgeContainer<EdgeInfo> in = _inEdges.get(vertex);
      if (in != null) {
        for (Edge<EdgeInfo> edge : in) {
          _outEdges.get(edge.getSource()).removeEdge(edge);
        }
        _inEdges.set(vertex, null);
      }
      super.removeVertexLazy(vertex);
    }
  }
/** This removes the given vertex from this directed graph.
   *
   * @param vertex the vertex to remove from the graph
   */
This removes the given vertex from this directed graph.
@param vertex the vertex to remove from the graph
This removes the given vertex from this directed graph . @param vertex the vertex to remove from the graph
@Override
  public void removeVertex(int vertex) {
    if (isVertex(vertex)) {
      EdgeContainer<EdgeInfo> out = _outEdges.get(vertex);
      if (out != null) {
        for (Edge<EdgeInfo> edge : out) {
          _inEdges.get(edge.getTarget()).removeEdge(edge);
        }
        _outEdges.set(vertex, null);
      }
      EdgeContainer<EdgeInfo> in = _inEdges.get(vertex);
      if (in != null) {
        for (Edge<EdgeInfo> edge : in) {
          _outEdges.get(edge.getSource()).removeEdge(edge);
        }
        _inEdges.set(vertex, null);
      }
      super.removeVertexLazy(vertex);
    }
  }
@ Override public void removeVertex ( int vertex ) { if ( isVertex ( vertex ) ) { EdgeContainer < EdgeInfo > out = _outEdges . get ( vertex ) ; if ( out != null ) { for ( Edge < EdgeInfo > edge : out ) { _inEdges . get ( edge . getTarget ( ) ) . removeEdge ( edge ) ; } _outEdges . set ( vertex , null ) ; } EdgeContainer < EdgeInfo > in = _inEdges . get ( vertex ) ; if ( in != null ) { for ( Edge < EdgeInfo > edge : in ) { _outEdges . get ( edge . getSource ( ) ) . removeEdge ( edge ) ; } _inEdges . set ( vertex , null ) ; } super . removeVertexLazy ( vertex ) ; } }
This removes the given vertex from this directed graph.
This removes the given vertex from this directed graph .
// remove the edges from and to this vertex from other vertices // edge lists