This documents the development version of NetworkX. Documentation for the current release can be found here.
Test directed graph for strong connectivity.
A directed graph is strongly connected if and only if every vertex in the graph is reachable from every other vertex.
- GNetworkX Graph
A directed graph.
True if the graph is strongly connected, False otherwise.
If G is undirected.
For directed graphs only.