WOLFRAM

Wolfram 语言与系统参考资料中心

找出图的出分量和入分量

在此范例中，找出有向图的最大的强连通分量，以及相应的出分量和入分量.

    
Wolfram Language code: g = [image];
找出图的最大的强连通分量：
Wolfram Language code: bigComponent = Last@SortBy[ConnectedComponents[g], Length];
Wolfram Language code: name = {"Largest strongly connected component", "In-component", "Out-component", "Other 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]]};
绘制结果：
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}]]