src/main/java/de/dfki/lt/loot/digraph/DiGraph.java
public void compactStable() {
    int[] newNumber = new int[_outEdges.size()];
    for (int i = 0; i < newNumber.length; ++i) {
      newNumber[i] = i;
    }

    // get the lowest deleted and the highest non-deleted vertex
    int targetIndex = _deletedVertices.nextSetBit(0);
    if (targetIndex < 0) return;
    int sourceIndex = targetIndex;
    while (sourceIndex < newNumber.length) {
      while (isDeletedVertex(sourceIndex)) {
        newNumber[sourceIndex] = -1;
        ++sourceIndex;
      }
      if (sourceIndex < newNumber.length) {
        newNumber[sourceIndex] = targetIndex;
        moveEdgeContainer(sourceIndex, targetIndex);
      }
      ++targetIndex;
      ++sourceIndex;
    }
    compactRenumber(newNumber);
  }
/** Compact this graph, i.e., fill the deleted vertices (holes) through
   *  renumbering the vertices in a stable way.
   */
Compact this graph, i.e., fill the deleted vertices (holes) through
renumbering the vertices in a stable way.
Compact this graph i . e . fill the deleted vertices ( holes ) through renumbering the vertices in a stable way .
public void compactStable() {
    int[] newNumber = new int[_outEdges.size()];
    for (int i = 0; i < newNumber.length; ++i) {
      newNumber[i] = i;
    }
    int targetIndex = _deletedVertices.nextSetBit(0);
    if (targetIndex < 0) return;
    int sourceIndex = targetIndex;
    while (sourceIndex < newNumber.length) {
      while (isDeletedVertex(sourceIndex)) {
        newNumber[sourceIndex] = -1;
        ++sourceIndex;
      }
      if (sourceIndex < newNumber.length) {
        newNumber[sourceIndex] = targetIndex;
        moveEdgeContainer(sourceIndex, targetIndex);
      }
      ++targetIndex;
      ++sourceIndex;
    }
    compactRenumber(newNumber);
  }
public void compactStable ( ) { int [ ] newNumber = new int [ _outEdges . size ( ) ] ; for ( int i = 0 ; i < newNumber . length ; ++ i ) { newNumber [ i ] = i ; } int targetIndex = _deletedVertices . nextSetBit ( 0 ) ; if ( targetIndex < 0 ) return ; int sourceIndex = targetIndex ; while ( sourceIndex < newNumber . length ) { while ( isDeletedVertex ( sourceIndex ) ) { newNumber [ sourceIndex ] = - 1 ; ++ sourceIndex ; } if ( sourceIndex < newNumber . length ) { newNumber [ sourceIndex ] = targetIndex ; moveEdgeContainer ( sourceIndex , targetIndex ) ; } ++ targetIndex ; ++ sourceIndex ; } compactRenumber ( newNumber ) ; }
Compact this graph, i.e., fill the deleted vertices (holes) through
  renumbering the vertices in a stable way.
Compact this graph i . e . fill the deleted vertices ( holes ) through renumbering the vertices in a stable way .
// get the lowest deleted and the highest non-deleted vertex