WeaklyConnectedComponents

gives the weakly connected components of the graph g.

WeaklyConnectedComponents[g,{v1,v2,}]

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

WeaklyConnectedComponents[g,patt]

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

WeaklyConnectedComponents[{vw,},]

uses rules vw to specify the graph g.

Details

• 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.

Examples

open allclose all

Basic Examples(1)

Give the weakly connected components of a graph:

 In[1]:=
 Out[1]=
 In[2]:=
 Out[2]=

Highlight the components:

 In[3]:=
 Out[3]=