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