src/main/java/de/dfki/lt/loot/digraph/DirectedBiGraph.java
public void dfsInverse(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);
        dfsVisitInverse(vertex, visitor, visited);
      }
    }
  }
/** 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. This dfs 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 depth first manner. The vertex list
is traversed in order, and every non-visited vertex is then taken as
start vertex, consecutively. This dfs 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 depth first manner . The vertex list is traversed in order and every non - visited vertex is then taken as start vertex consecutively . This dfs 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 .
public void dfsInverse(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);
        dfsVisitInverse(vertex, visitor, visited);
      }
    }
  }
public void dfsInverse ( 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 ) ; dfsVisitInverse ( vertex , visitor , visited ) ; } } }
Visit all vertices of this graph in a depth first manner.
Visit all vertices of this graph in a depth first manner .