networkx.algorithms.components.is_strongly_connected¶

is_strongly_connected
(G)[source]¶ 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.
Parameters: G (NetworkX Graph) – A directed graph. Returns: connected – True if the graph is strongly connected, False otherwise. Return type: bool Raises: NetworkXNotImplemented: – If G is undirected. See also
is_weakly_connected()
,is_semiconnected()
,is_connected()
,is_biconnected()
,strongly_connected_components()
Notes
For directed graphs only.