bicomponent.dist | R Documentation |

`bicomponent.dist`

returns the bicomponents of an input graph, along with size distribution and membership information.

bicomponent.dist(dat, symmetrize = c("strong", "weak"))

`dat` |
a graph or graph stack. |

`symmetrize` |
symmetrization rule to apply when pre-processing the input (see |

The bicomponents of undirected graph `G`

are its maximal 2-connected vertex sets. `bicomponent.dist`

calculates the bicomponents of *G*, after first coercing to undirected form using the symmetrization rule in `symmetrize`

. In addition to bicomponent memberships, various summary statistics regarding the bicomponent distribution are returned; see below.

A list containing

`members ` |
A list, with one entry per bicomponent, containing component members. |

`memberships ` |
A vector of component memberships, by vertex. (Note: memberships may not be unique.) Vertices not belonging to any bicomponent have membership values of |

`csize ` |
A vector of component sizes, by bicomponent. |

`cdist ` |
A vector of length |

Remember that bicomponents can intersect; when this occurs, the relevant vertices' entries in the membership vector are assigned to one of the overlapping bicomponents on an arbitrary basis. The `members`

element of the return list is the safe way to recover membership information.

Carter T. Butts buttsc@uci.edu

Brandes, U. and Erlebach, T. (2005). *Network Analysis: Methodological Foundations.* Berlin: Springer.

`component.dist`

, `cutpoints`

, `symmetrize`

#Draw a moderately sparse graph g<-rgraph(25,tp=2/24,mode="graph") #Compute the bicomponents bicomponent.dist(g)

Embedding an R snippet on your website

Add the following code to your website.

For more information on customizing the embed code, read Embedding Snippets.