Warning

This documents an unmaintained version of NetworkX. Please upgrade to a maintained version and see the current NetworkX documentation.

weakly_connected_components

weakly_connected_components(G)

Generate weakly connected components of G.

Parameters:G (NetworkX graph) – A directed graph Returns:comp – A generator of sets of nodes, one for each weakly connected component of G. Return type:generator of sets

Examples

Generate a sorted list of weakly connected components, largest first.

>>> G = nx.path_graph(4, create_using=nx.DiGraph())
>>> G.add_path([10, 11, 12])
>>> [len(c) for c in sorted(nx.weakly_connected_components(G),
...                         key=len, reverse=True)]
[4, 3]

If you only want the largest component, it’s more efficient to use max instead of sort.

>>> largest_cc = max(nx.weakly_connected_components(G), key=len)

See also

strongly_connected_components()

Notes

For directed graphs only.