is_weakly_connected(G)
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.
For directed graphs only.
A directed graph.
If G is undirected.
True if the graph is weakly connected, False otherwise.
Test directed graph for weak connectivity.
>>> G = nx.DiGraph([(0, 1), (2, 1)])
... G.add_node(3)
... nx.is_weakly_connected(G) # node 3 is not connected to the graph False
>>> G.add_edge(2, 3)See :
... nx.is_weakly_connected(G) True
The following pages refer to to this document either explicitly or contain code examples using this.
networkx.algorithms.components.strongly_connected.is_strongly_connected
networkx.algorithms.components.connected.is_connected
networkx.algorithms.components.biconnected.is_biconnected
networkx.algorithms.components.semiconnected.is_semiconnected
networkx.algorithms.components.weakly_connected.is_weakly_connected
Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.
Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)
SVG is more flexible but power hungry; and does not scale well to 50 + nodes.
All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them