A directed graph is called weakly connected if replacing all of its directed edges with undirected edges produces a connected (undirected) graph. It is strongly connected if it contains a directed path from $u$ to $v$ and a directed path from $v$ to $u$ for every pair of vertices $u$, $v$. The strong components are the maximal strongly connected subgraphs.
Class Summary Class Description BiconnectivityInspector<V,E>Allows obtaining various connectivity aspects of a graph. BlockCutpointGraph<V,E>A Block-Cutpoint graph (also known as a block-cut tree). ConnectivityInspector<V,E>Allows obtaining various connectivity aspects of a graph. GabowStrongConnectivityInspector<V,E>Computes the strongly connected components of a directed graph. KosarajuStrongConnectivityInspector<V,E>Computes strongly connected components of a directed graph.