PRODUCTS
PURCHASE
FOR USERS
COMPANY
OUR SITES
DOCUMENTATION CENTER SEARCH
Graph Utilities Package
>
Graph Utilities
Package Symbol
Graph Utilities Package
Tutorials »
|
StrongComponents
WeakComponents
See Also »
|
Graph Utilities Package
More About »
Bicomponents
Bicomponents[
g
]
gives the biconnected components of the undirected graph
g
.
MORE INFORMATION
To use
Bicomponents
, you first need to load the
Graph Utilities Package
using
Needs
["GraphUtilities`"]
.
A biconnected component is a maximal subgraph that has no cutpoint, where a cutpoint is a vertex
v
such that the subgraph becomes disconnected if
v
and all its edges are removed.
Bicomponents
treats the input
g
as an undirected graph.
EXAMPLES
CLOSE ALL
Basic Examples
(2)
Needs["GraphUtilities`"]
This shows that a simple line with two vertices is biconnected:
In[2]:=
In[3]:=
Out[3]=
In[4]:=
Out[4]=
Needs["GraphUtilities`"]
This defines a small graph:
In[2]:=
In[3]:=
Out[3]=
The graph has four bicomponents, one for each cycle and two for the line joining the cycles:
In[4]:=
Out[4]=
Properties & Relations
(1)
SEE ALSO
StrongComponents
WeakComponents
TUTORIALS
Graph Utilities Package
MORE ABOUT
Graph Utilities Package
© 2008 Wolfram Research, Inc.
EXAMPLES
Basic Examples 
Properties & Relations 