7.12.2.1. networkx.algorithms.components.is_strongly_connected¶
-
networkx.algorithms.components.is_strongly_connected(G)[source]¶ Test directed graph for strong connectivity.
Parameters: G : NetworkX Graph
A directed graph.
Returns: connected : bool
True if the graph is strongly connected, False otherwise.
Raises: NetworkXNotImplemented:
If G is undirected.
See also
is_weakly_connected,is_semiconnected,is_connected,is_biconnected,strongly_connected_componentsNotes
For directed graphs only.