Wolfram Mathematica Documentation Center
DOCUMENTATION CENTER SEARCH
New to Mathematica? Find your learning path »
Graph Utilities Package >
GRAPH UTILITIES PACKAGE SYMBOLTutorials »|See Also »|More About »

StrongComponents

StrongComponents[g]
gives a list of all strongly connected components in the directed graph g.
MORE INFORMATION
  • A strongly connected component of a directed graph is a set of vertices such that there is a path connecting any two vertices.
EXAMPLESCLOSE ALL
Basic Examples   (1)
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]=
Properties & Relations   (1)
This defines a small graph:
finds connected components of a directed graph:
WeakComponents finds connected components, assuming that the graph is undirected:
Ask a question about this page  |  Suggest an improvement  |  Leave a message for the team
Format:   HTML  |  CDF