This is documentation for Mathematica 8, which was
based on an earlier version of the Wolfram Language.
View current documentation (Version 11.2)

StrongComponents

StrongComponents[g]
gives a list of all strongly connected components in the directed graph g.
  • A strongly connected component of a directed graph is a set of vertices such that there is a path connecting any two vertices.
This defines a small graph:
This finds all strong components of the graph:
This defines a small graph:
Needs["GraphUtilities`"]
In[2]:=
Click for copyable input
In[3]:=
Click for copyable input
Out[3]=
This finds all strong components of the graph:
In[4]:=
Click for copyable input
Out[4]=
This defines a small graph:
finds connected components of a directed graph:
WeakComponents finds connected components, assuming that the graph is undirected: