Return a list of graphs of each connected component of G.
The list is ordered from largest connected component to smallest. For undirected graphs only.
Examples
Get largest connected component
>>> G=nx.path_graph(4)
>>> G.add_edge(5,6)
>>> H=nx.connected_component_subgraphs(G)[0]