WOLFRAM

Wolfram Language & System Documentation Center

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.

    
Wolfram Language code: g = [image];
Find the largest strongly connected components of a graph:
Wolfram Language code: bigComponent = Last@SortBy[ConnectedComponents[g], Length];
Wolfram Language code: name = {"Largest strongly connected component", "In-component", "Out-component", "Other components"};
Compute in-and-out components:
Wolfram Language code: info = {HighlightGraph[g, Subgraph[g, #], GraphHighlightStyle -> "DehighlightFade"]}& /@ {bigComponent, VertexInComponent[g, bigComponent], VertexOutComponent[g, bigComponent], Complement[VertexList[g], VertexInComponent[g, bigComponent], VertexOutComponent[g, bigComponent]]};
Plot the results:
Wolfram Language code: ShowPlotSamples[name_, info_] := Framed[Column[{Style[name, 14, Bold, FontFamily -> "Verdana"], Grid[{info}, Spacings -> {1, 0}]}, Alignment -> Center], RoundingRadius -> 9, FrameStyle -> None, Background -> GrayLevel@0.90];
Wolfram Language code: Column[MapThread[ShowPlotSamples, {name, info}]]