Module org.jgrapht.core
Package org.jgrapht.alg.connectivity
Algorithms dealing with various connectivity aspects of a graph.
A graph is connected when there is a path between every pair of vertices. In a connected graph,
there are no unreachable vertices. A graph that is not connected is disconnected. A connected
component is a maximal connected subgraph of $G$. Each vertex belongs to exactly one connected
component, as does each edge.
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 BlockCutpoint graph (also known as a blockcut 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.TreeDynamicConnectivity<T> Data structure for storing dynamic trees and querying node connectivity