Class KosarajuStrongConnectivityInspector<V,E>

java.lang.Object
org.jgrapht.alg.connectivity.AbstractStrongConnectivityInspector<V,E>
org.jgrapht.alg.connectivity.KosarajuStrongConnectivityInspector<V,E>
Type Parameters:
V - the graph vertex type
E - the graph edge type
All Implemented Interfaces:
StrongConnectivityAlgorithm<V,E>

public class KosarajuStrongConnectivityInspector<V,E> extends AbstractStrongConnectivityInspector<V,E>
Computes strongly connected components of a directed graph. The algorithm is implemented after "Cormen et al: Introduction to algorithms", Chapter 22.5. It has a running time of $O(V + E)$.

Unlike ConnectivityInspector, this class does not implement incremental inspection. The full algorithm is executed at the first call of stronglyConnectedSets() or AbstractStrongConnectivityInspector.isStronglyConnected().