StrongComponents

As of Version 10, all the functionality of the GraphUtilities package is built into the Wolfram System. >>

StrongComponents[g]
gives a list of all strongly connected components in the directed graph g.

DetailsDetails

  • StrongComponents functionality is now available in the built-in Wolfram Language function ConnectedComponents.
  • To use , you first need to load the Graph Utilities Package using Needs["GraphUtilities`"].
  • A strongly connected component of a directed graph is a set of vertices such that there is a path connecting any two vertices.

ExamplesExamplesopen allclose all

Basic Examples  (2)Basic Examples  (2)

This defines a small graph:

In[1]:=
Click for copyable input
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]=

has been superseded by ConnectedComponents:

In[1]:=
Click for copyable input
Out[1]=
In[2]:=
Click for copyable input
Out[2]=