networkx.algorithms.components.is_weakly_connected¶
- 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.
Note that if a graph is strongly connected (i.e. the graph is connected even when we account for directionality), it is by definition weakly connected as well.
- Parameters
- GNetworkX Graph
A directed graph.
- Returns
- connectedbool
True if the graph is weakly connected, False otherwise.
- Raises
- NetworkXNotImplemented
If G is undirected.
See also
Notes
For directed graphs only.