biConnComp {RBGL} | R Documentation

## Compute biconnected components for a graph

### Description

Compute biconnected components for a graph

### Usage

    biConnComp(g)
    articulationPoints(g)

### Arguments

`g` | an instance of the `graph` class

### Details

A biconnected graph is a connected graph that remains connected when any one of its vertices, and all the edges incident on this vertex, is removed and the graph remains connected. A biconnected component of a graph is a subgraph which is biconnected. An integer label is assigned to each edge to indicate which biconnected component it's in.

A vertex in a graph is called an articulation point if removing it increases the number of connected components.

See the documentation for the Boost Graph Library for more details.

### Value

For `biConnComp`: a vector whose length is no. of biconnected components, each entry is a list of nodes that are on the same biconnected components.

For `articulationPoints`: a vector of articulation points in the graph.

### Author(s)

Li Long <li.long@isb-sib.ch>

### References

Boost Graph Library ( www.boost.org/libs/graph/doc/index.html )

The Boost Graph Library: User Guide and Reference Manual; by Jeremy G. Siek, Lie-Quan Lee, and Andrew Lumsdaine; (Addison-Wesley, Pearson Education Inc., 2002), xxiv+321pp. ISBN 0-201-72914-8

### Examples

    con <- file(system.file("XML/conn.gxl",package="RBGL"), open="r")
    coex <- fromGXL(con)
    close(con)

    biConnComp(coex)
    articulationPoints(coex)

[Package RBGL version 1.63.1 Index]