is_strongly_connected(G)
A directed graph is strongly connected if and only if every vertex in the graph is reachable from every other vertex.
For directed graphs only.
A directed graph.
If G is undirected.
True if the graph is strongly connected, False otherwise.
Test directed graph for strong connectivity.
>>> G = nx.DiGraph([(0, 1), (1, 2), (2, 3), (3, 0), (2, 4), (4, 2)])
... nx.is_strongly_connected(G) True
>>> G.remove_edge(2, 3)See :
... nx.is_strongly_connected(G) False
The following pages refer to to this document either explicitly or contain code examples using this.
networkx.algorithms.components.strongly_connected.is_strongly_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