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[28]:=
Click for copyable input
In[29]:=
Click for copyable input
In[30]:=
Click for copyable input
In[31]:=
Click for copyable input
In[32]:=
Click for copyable input
In[33]:=
Click for copyable input
Out[33]=
New to Mathematica? Find your learning path »
Have a question? Ask support »