Document

is_semiconnected(G, topo_order=None)

A graph is semiconnected if, and only if, for any pair of nodes, either one is reachable from the other, or they are mutually reachable.

Parameters

G : NetworkX graph: A directed graph.
topo_order: list or tuple, optional :: A topological order for G (if None, the function will compute one)

Raises

NetworkXNotImplemented: If the input graph is undirected.
NetworkXPointlessConcept: If the graph is empty.

Returns

semiconnected : bool: True if the graph is semiconnected, False otherwise.

Returns True if the graph is semiconnected, False otherwise.

Examples

>>> G = nx.path_graph(4, create_using=nx.DiGraph())
... print(nx.is_semiconnected(G))
True

>>> G = nx.DiGraph([(1, 2), (3, 2)])
... print(nx.is_semiconnected(G))
False

See :

Back References

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

Local connectivity graph

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