src/main/java/de/dfki/lt/loot/digraph/DirectedBiGraph.java
public void bfsInverse(GraphVisitor<EdgeInfo> visitor) {
    BitSet visited = new BitSet(); // all bits are initially false
    for(int vertex = 0; vertex < _outEdges.size(); ++vertex) {
      if (! isDeletedVertex(vertex) && ! visited.get(vertex)) {
        visitor.startVertex(vertex, this);
        bfsVisitInverse(vertex, visitor, visited);
      }
    }
  }
/** 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. This bfs works on the inverse of the graph,
   *  i.e., it uses the incoming instead of the outgoing edges.
   *  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. This bfs works on the inverse of the graph,
i.e., it uses the incoming instead of the outgoing edges.
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 . This bfs works on the inverse of the graph i . e . it uses the incoming instead of the outgoing edges . The desired functionality can be implemented by the given GraphVisitor argument .
public void bfsInverse(GraphVisitor<EdgeInfo> visitor) {
    BitSet visited = new BitSet(); 
    for(int vertex = 0; vertex < _outEdges.size(); ++vertex) {
      if (! isDeletedVertex(vertex) && ! visited.get(vertex)) {
        visitor.startVertex(vertex, this);
        bfsVisitInverse(vertex, visitor, visited);
      }
    }
  }
public void bfsInverse ( GraphVisitor < EdgeInfo > visitor ) { BitSet visited = new BitSet ( ) ; for ( int vertex = 0 ; vertex < _outEdges . size ( ) ; ++ vertex ) { if ( ! isDeletedVertex ( vertex ) && ! visited . get ( vertex ) ) { visitor . startVertex ( vertex , this ) ; bfsVisitInverse ( vertex , visitor , visited ) ; } } }
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