|
networks[bicomponents] - compute the biconnected components of a graph
|
|
Calling Sequence
|
|
bicomponents(G)
|
|
|
Description
|
|
|
•
|
A connected graph can be decomposed into two connected components possibly connected by bridges. This routine returns two sets in a list of length 2: the first indicating the bridges and the second indicating the biconnected components.
|
|
•
|
Bridges are specified as edges. The set of bridges may be empty.
|
|
•
|
The biconnected components are each specified as sets of edges. This set of bicomponents may be empty as for example in the case of a path.
|
|
•
|
This routine is normally loaded using the command with(networks) but may also be referenced using the full name networks[bicomponents](...).
|
|
|
Download Help Document
Was this information helpful?
