src/main/java/de/dfki/lt/loot/digraph/DiGraph.java
public void cleanupEdges() {
    // remove the edges to this vertex from other vertices edge lists
    for (int v = 0; v < _outEdges.size(); ++v) {
      if (isVertex(v)) {
        EdgeContainer<EI> out = _outEdges.get(v);
        if (out != null) {
          Iterator<Edge<EI>> edgeIt = out.iterator();
          while (edgeIt.hasNext()) {
            Edge<EI> edge = edgeIt.next();
            if (! isVertex(edge.getTarget()))
              edgeIt.remove();
          }
        }
      } else {
        _outEdges.set(v, null);
      }
    }
  }
/** Remove all edges pointing to a deleted vertex. To be called after
   *  subsequent calls to removeVertexLazy
   */
Remove all edges pointing to a deleted vertex. To be called after
subsequent calls to removeVertexLazy
Remove all edges pointing to a deleted vertex . To be called after subsequent calls to removeVertexLazy
public void cleanupEdges() {
    for (int v = 0; v < _outEdges.size(); ++v) {
      if (isVertex(v)) {
        EdgeContainer<EI> out = _outEdges.get(v);
        if (out != null) {
          Iterator<Edge<EI>> edgeIt = out.iterator();
          while (edgeIt.hasNext()) {
            Edge<EI> edge = edgeIt.next();
            if (! isVertex(edge.getTarget()))
              edgeIt.remove();
          }
        }
      } else {
        _outEdges.set(v, null);
      }
    }
  }
public void cleanupEdges ( ) { for ( int v = 0 ; v < _outEdges . size ( ) ; ++ v ) { if ( isVertex ( v ) ) { EdgeContainer < EI > out = _outEdges . get ( v ) ; if ( out != null ) { Iterator < Edge < EI > > edgeIt = out . iterator ( ) ; while ( edgeIt . hasNext ( ) ) { Edge < EI > edge = edgeIt . next ( ) ; if ( ! isVertex ( edge . getTarget ( ) ) ) edgeIt . remove ( ) ; } } } else { _outEdges . set ( v , null ) ; } } }
Remove all edges pointing to a deleted vertex.
Remove all edges pointing to a deleted vertex .
// remove the edges to this vertex from other vertices edge lists