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.
New to Mathematica? Find your learning path »
Have a question? Ask support »