networkx largest component
# Option 1 G = max(nx.connected_component_subgraphs(G), key=len) # Option 2 for component in list(nx.connected_components(G)): if len(component) < 16451: # Size of the largest component for node in component: G.remove_node(node)
Here is what the above code is Doing:
1. Find all connected components in the graph
2. Find the largest connected component
3. Remove all nodes that are not in the largest connected component