src/main/java/de/dfki/lt/loot/digraph/AbstractGraph.java
public void dfs(GraphVisitor<EI> visitor) {
    BitSet visited = new BitSet();
    for(int vertex = 0; vertex < getNumberOfVertices(); ++vertex) {
      if (! isDeletedVertex(vertex) && ! visited.get(vertex)) {
        visitor.startVertex(vertex, this);
        dfsVisit(vertex, visitor, visited, false);
      }
    }
  }
/** Visit all vertices of this graph in a depth first manner. The vertex list
   *  is traversed in order, and every non-visited vertex is then taken as
   *  start vertex, consecutively.
   *  The desired functionality can be implemented by the given {@link
   *  GraphVisitor} argument.
   */
Visit all vertices of this graph in a depth first manner. The vertex list
is traversed in order, and every non-visited vertex is then taken as
start vertex, consecutively.
The desired functionality can be implemented by the given {@link
GraphVisitor} argument.
Visit all vertices of this graph in a depth first manner . The vertex list is traversed in order and every non - visited vertex is then taken as start vertex consecutively . The desired functionality can be implemented by the given { @link GraphVisitor } argument .
public void dfs(GraphVisitor<EI> visitor) {
    BitSet visited = new BitSet();
    for(int vertex = 0; vertex < getNumberOfVertices(); ++vertex) {
      if (! isDeletedVertex(vertex) && ! visited.get(vertex)) {
        visitor.startVertex(vertex, this);
        dfsVisit(vertex, visitor, visited, false);
      }
    }
  }
public void dfs ( GraphVisitor < EI > visitor ) { BitSet visited = new BitSet ( ) ; for ( int vertex = 0 ; vertex < getNumberOfVertices ( ) ; ++ vertex ) { if ( ! isDeletedVertex ( vertex ) && ! visited . get ( vertex ) ) { visitor . startVertex ( vertex , this ) ; dfsVisit ( vertex , visitor , visited , false ) ; } } }
Visit all vertices of this graph in a depth first manner.
Visit all vertices of this graph in a depth first manner .