networkx.algorithms.is_weakly_connected¶

networkx.algorithms.is_weakly_connected(G)[source]¶

Test directed graph for weak connectivity.

A directed graph is weakly connected if, and only if, the graph is connected when the direction of the edge between nodes is ignored.

Parameters:	G : NetworkX Graph A directed graph.
Returns:	connected : bool True if the graph is weakly connected, False otherwise.
Raises:	NetworkXNotImplemented: If G is undirected.

See also

is_strongly_connected, is_semiconnected, is_connected, is_biconnected, weakly_connected_components

Notes

For directed graphs only.