Find In-and-Out Components of Graphs

This example finds the largest strongly connected component of a directed graph, along with the corresponding in-and-out components.

    
In[1]:=
Click for copyable input
Find the largest strongly connected components of a graph:
In[2]:=
Click for copyable input
In[3]:=
Click for copyable input
Compute in-and-out components:
In[4]:=
Click for copyable input
Plot the results:
In[5]:=
Click for copyable input
In[6]:=
Click for copyable input
Out[6]=