src/main/java/de/dfki/lt/loot/fsa/FiniteAutomaton.java
public void makeTotal() {
    int deadEnd = newVertex();
    for(int v = 0; v < getNumberOfVertices(); ++v) {
      if (isVertex(v)) {
        for (EdgeInfo info : getAlphabet()) {
          if (findEdge(v, info, _comp) == null) {
            newEdge(info, v, deadEnd);
          }
        }
      }
    }
  }
/** we add a virtual `dead end' vertex where all non-existent edges point to.
   * this is necessary because some algorithms only work with total graphs,
   * meaning that delta is a total function V x A --> V.
   */
we add a virtual `dead end' vertex where all non-existent edges point to.
this is necessary because some algorithms only work with total graphs,
meaning that delta is a total function V x A --> V.
we add a virtual ` dead end ' vertex where all non - existent edges point to . this is necessary because some algorithms only work with total graphs meaning that delta is a total function V x A -- > V .
public void makeTotal() {
    int deadEnd = newVertex();
    for(int v = 0; v < getNumberOfVertices(); ++v) {
      if (isVertex(v)) {
        for (EdgeInfo info : getAlphabet()) {
          if (findEdge(v, info, _comp) == null) {
            newEdge(info, v, deadEnd);
          }
        }
      }
    }
  }
public void makeTotal ( ) { int deadEnd = newVertex ( ) ; for ( int v = 0 ; v < getNumberOfVertices ( ) ; ++ v ) { if ( isVertex ( v ) ) { for ( EdgeInfo info : getAlphabet ( ) ) { if ( findEdge ( v , info , _comp ) == null ) { newEdge ( info , v , deadEnd ) ; } } } } }
we add a virtual `dead end' vertex where all non-existent edges point to.
we add a virtual ` dead end ' vertex where all non - existent edges point to .