Wolfram Language & System 11.0 (2016)|Legacy Documentation

This is documentation for an earlier version of the Wolfram Language.View current documentation (Version 11.2)


gives the weakly connected components of the graph g.

gives the weakly connected components that include at least one of the vertices v1, v2, .

gives the connected components that include a vertex that matches the pattern patt.

uses rules vw to specify the graph g.


  • WeaklyConnectedComponents returns a list of components {c1,c2,}, where each component ci is given as a list of vertices.
  • Vertices u and v are in the same component ci if there is a sequence of edges joining u and v.
  • Components ci are ordered by their length, with the largest component first.
  • WeaklyConnectedComponents works with undirected graphs, directed graphs, multigraphs, and mixed graphs.
Introduced in 2012
| Updated in 2015