Class GabowStrongConnectivityInspector<V,​E>

  • Type Parameters:
    V - the graph vertex type
    E - the graph edge type
    All Implemented Interfaces:
    StrongConnectivityAlgorithm<V,​E>

    public class GabowStrongConnectivityInspector<V,​E>
    extends AbstractStrongConnectivityInspector<V,​E>
    Computes the strongly connected components of a directed graph. The implemented algorithm follows Cheriyan-Mehlhorn/Gabow's algorithm presented in Path-based depth-first search for strong and biconnected components by Gabow (2000). The running time is order of $O(|V|+|E|)$.