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.
G (NetworkX Graph) – A directed graph.
connected – True if the graph is strongly connected, False otherwise.
- Return type
NetworkXNotImplemented: – If G is undirected.
For directed graphs only.