ConnectedQ[g]yields True if undirected graph g is connected. If g is directed, the function returns True if the underlying undirected graph is connected.
yields True if the directed graph g is strongly connected.
yields True if the directed graph g is weakly connected.
ConnectedComponents StronglyConnectedComponents WeaklyConnectedComponents
400+ new features, including the new Wolfram Predictive Interface, social network analysis, enterprise CDF deployment, and more »