Generate connected components.
Parameters: G (NetworkX graph) – An undirected graph Returns: comp – A generator of sets of nodes, one for each component of G. Return type: generator of sets
Generate a sorted list of connected components, largest first.
>>> G = nx.path_graph(4) >>> G.add_path([10, 11, 12]) >>> [len(c) for c in sorted(nx.connected_components(G), key=len, reverse=True)] [4, 3]
If you only want the largest connected component, it’s more efficient to use max instead of sort.
>>> largest_cc = max(nx.connected_components(G), key=len)
For undirected graphs only.