StrongComponents
GraphUtilities`
GraphUtilities`
StrongComponents
As of Version 10, all the functionality of the GraphUtilities package is built into the Wolfram System. »
StrongComponents[g]
gives a list of all strongly connected components in the directed graph g.
更多信息和选项
- StrongComponents functionality is now available in the built-in Wolfram Language function ConnectedComponents.
- To use StrongComponents, you first need to load the Graph Utilities Package using Needs["GraphUtilities`"].
- A strongly connected component of a directed graph is a set of vertices such that there is a path connecting any two vertices.
范例
基本范例 (2)
Needs["GraphUtilities`"]g = {1 -> 2, 2 -> 3, 3 -> 1, 1 -> 4, 2 -> 5, 5 -> 6, 6 -> 7, 7 -> 6};GraphPlot[g, DirectedEdges -> True, VertexLabeling -> True]This finds all strong components of the graph:
StrongComponents[g]StrongComponents has been superseded by ConnectedComponents:
g = Graph[{1 -> 2, 2 -> 3, 3 -> 1, 1 -> 4, 2 -> 5, 5 -> 6, 6 -> 7, 7 -> 6}]ConnectedComponents[g]
Wolfram Research (2007)，StrongComponents，Wolfram 语言函数，https://reference.wolfram.com/language/GraphUtilities/ref/StrongComponents.html.
文本
Wolfram Research (2007)，StrongComponents，Wolfram 语言函数，https://reference.wolfram.com/language/GraphUtilities/ref/StrongComponents.html.
CMS
Wolfram 语言. 2007. "StrongComponents." Wolfram 语言与系统参考资料中心. Wolfram Research. https://reference.wolfram.com/language/GraphUtilities/ref/StrongComponents.html.
APA
Wolfram 语言. (2007). StrongComponents. Wolfram 语言与系统参考资料中心. 追溯自 https://reference.wolfram.com/language/GraphUtilities/ref/StrongComponents.html 年