GraphUtilities`
GraphUtilities`
WeakComponents
As of Version 10, all the functionality of the GraphUtilities package is built into the Wolfram System. »
WeakComponents[g]
gives a list of all weakly connected components in the undirected graph g.
更多信息和选项
- WeakComponents functionality is now available in the built-in Wolfram Language function WeaklyConnectedComponents.
- To use WeakComponents, you first need to load the Graph Utilities Package using Needs["GraphUtilities`"].
- A weakly connected component of a directed graph is a set of vertices such that for each pair of vertices, there is a path between them. The graph g is considered as undirected.
范例
基本范例 (2)
This shows that the following graph has two weakly connected components:
WeakComponents has been superseded by WeaklyConnectedComponents:
Wolfram Research (2007)，WeakComponents，Wolfram 语言函数，https://reference.wolfram.com/language/GraphUtilities/ref/WeakComponents.html.
文本
Wolfram Research (2007)，WeakComponents，Wolfram 语言函数，https://reference.wolfram.com/language/GraphUtilities/ref/WeakComponents.html.
CMS
Wolfram 语言. 2007. "WeakComponents." Wolfram 语言与系统参考资料中心. Wolfram Research. https://reference.wolfram.com/language/GraphUtilities/ref/WeakComponents.html.
APA
Wolfram 语言. (2007). WeakComponents. Wolfram 语言与系统参考资料中心. 追溯自 https://reference.wolfram.com/language/GraphUtilities/ref/WeakComponents.html 年