number_connected_components(G)

Notes

For undirected graphs only.

Parameters

G : NetworkX graph

An undirected graph.

Returns

n : integer

Number of connected components

Returns the number of connected components.

See Also

connected_components

number_strongly_connected_components

number_weakly_connected_components

Examples

>>> G = nx.Graph([(0, 1), (1, 2), (5, 6), (3, 4)])
... nx.number_connected_components(G)
3

See :

Back References

The following pages refer to to this document either explicitly or contain code examples using this.

networkx.algorithms.components.connected.number_connected_components networkx.algorithms.components.weakly_connected.number_weakly_connected_components networkx.algorithms.components.strongly_connected.number_strongly_connected_components

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

---

GitHub : /networkx/algorithms/components/connected.py#69
type: <class 'function'>
Commit: