WeakComponents
WeakComponents[g]
gives a list of all weakly connected components in the undirected graph g.
Details and Options
- 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.
Examples
Basic Examples (2)
This shows that the following graph has two weakly connected components:
WeakComponents has been superseded by WeaklyConnectedComponents:
Text
Wolfram Research (2007), WeakComponents, Wolfram Language function, https://reference.wolfram.com/language/GraphUtilities/ref/WeakComponents.html.
CMS
Wolfram Language. 2007. "WeakComponents." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/GraphUtilities/ref/WeakComponents.html.
APA
Wolfram Language. (2007). WeakComponents. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/GraphUtilities/ref/WeakComponents.html