Note

This documents the development version of NetworkX. Documentation for the current release can be found here.

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
GNetworkX Graph

A directed graph.

Returns
connectedbool

True if the graph is strongly connected, False otherwise.

Raises
NetworkXNotImplemented

If G is undirected.

Notes

For directed graphs only.