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.

    
Find the largest strongly connected components of a graph:
Compute in-and-out components:
Plot the results: