is_strongly_connected

is_strongly_connected(G)

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.

See also

is_weakly_connected

is_semiconnected

is_connected

is_biconnected

strongly_connected_components

Notes

For directed graphs only.