GRAPH UTILITIES PACKAGE SYMBOL
gives a list of all weakly connected components in the undirected graph g.
- To use , 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.
This shows that the following graph has two weakly connected components: