Generate weakly connected components of G.
G (NetworkX graph) – A directed graph
comp – A generator of sets of nodes, one for each weakly connected component of G.
- Return type
generator of sets
NetworkXNotImplemented – If G is undirected.
Generate a sorted list of weakly connected components, largest first.
>>> G = nx.path_graph(4, create_using=nx.DiGraph()) >>> nx.add_path(G, [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)
For directed graphs only.