Return a list of graphs of each strongly connected component of G.
The list is ordered from largest connected component to smallest.
For example, to get the largest strongly connected component: >>> G=nx.path_graph(4) >>> H=nx.strongly_connected_component_subgraphs(G)[0]