Examples of org.jgrapht.alg.StrongConnectivityInspector

org.jgrapht.alg.StrongConnectivityInspector

Complements the {@link org.jgrapht.alg.ConnectivityInspector} class withthe capability to compute the strongly connected components of a directed graph. The algorithm is implemented after "Cormen et al: Introduction to agorithms", Chapter 22.5. It has a running time of O(V + E).

Unlike {@link org.jgrapht.alg.ConnectivityInspector}, this class does not implement incremental inspection. The full algorithm is executed at the first call of {@link StrongConnectivityInspector#stronglyConnectedSets()} or {@link StrongConnectivityInspector#isStronglyConnected()}.

@author Christian Soltenborn @author Christian Hammer @since Feb 2, 2005

      }
    }


    //System.out.println(supp);


    StrongConnectivityInspector connInsp =
        new StrongConnectivityInspector(subGraph);


    List<Set<GroundLiteral>> tempLoopSet = connInsp.stronglyConnectedSets();
    List<Set<GroundLiteral>> loopSet = new ArrayList<Set<GroundLiteral>>();


    // Check whether the singleton strongly connected components are truly cycles
    for (Set<GroundLiteral> loop : tempLoopSet) {
      if (loop.size() == 1) {

Examples of org.jgrapht.alg.StrongConnectivityInspector

Related Classes of org.jgrapht.alg.StrongConnectivityInspector