EVOLUTION-MANAGER
Edit File: biconnected_components.html
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><title>R: Biconnected components</title> <meta http-equiv="Content-Type" content="text/html; charset=utf-8" /> <link rel="stylesheet" type="text/css" href="R.css" /> </head><body> <table width="100%" summary="page for biconnected_components {igraph}"><tr><td>biconnected_components {igraph}</td><td style="text-align: right;">R Documentation</td></tr></table> <h2>Biconnected components</h2> <h3>Description</h3> <p>Finding the biconnected components of a graph </p> <h3>Usage</h3> <pre> biconnected_components(graph) </pre> <h3>Arguments</h3> <table summary="R argblock"> <tr valign="top"><td><code>graph</code></td> <td> <p>The input graph. It is treated as an undirected graph, even if it is directed.</p> </td></tr> </table> <h3>Details</h3> <p>A graph is biconnected if the removal of any single vertex (and its adjacent edges) does not disconnect it. </p> <p>A biconnected component of a graph is a maximal biconnected subgraph of it. The biconnected components of a graph can be given by the partition of its edges: every edge is a member of exactly one biconnected component. Note that this is not true for vertices: the same vertex can be part of many biconnected components. </p> <h3>Value</h3> <p>A named list with three components: </p> <table summary="R valueblock"> <tr valign="top"><td><code>no</code></td> <td> <p>Numeric scalar, an integer giving the number of biconnected components in the graph.</p> </td></tr> <tr valign="top"><td><code>tree_edges</code></td> <td> <p>The components themselves, a list of numeric vectors. Each vector is a set of edge ids giving the edges in a biconnected component. These edges define a spanning tree of the component.</p> </td></tr> <tr valign="top"><td><code>component_edges</code></td> <td> <p>A list of numeric vectors. It gives all edges in the components.</p> </td></tr> <tr valign="top"><td><code>components</code></td> <td> <p>A list of numeric vectors, the vertices of the components.</p> </td></tr> <tr valign="top"><td><code>articulation_points</code></td> <td> <p>The articulation points of the graph. See <code><a href="articulation_points.html">articulation_points</a></code>.</p> </td></tr> </table> <h3>Author(s)</h3> <p>Gabor Csardi <a href="mailto:csardi.gabor@gmail.com">csardi.gabor@gmail.com</a> </p> <h3>See Also</h3> <p><code><a href="articulation_points.html">articulation_points</a></code>, <code><a href="components.html">components</a></code>, <code><a href="components.html">is_connected</a></code>, <code><a href="vertex_connectivity.html">vertex_connectivity</a></code> </p> <h3>Examples</h3> <pre> g <- disjoint_union( make_full_graph(5), make_full_graph(5) ) clu <- components(g)$membership g <- add_edges(g, c(which(clu==1), which(clu==2))) bc <- biconnected_components(g) </pre> <hr /><div style="text-align: center;">[Package <em>igraph</em> version 1.3.5 <a href="00Index.html">Index</a>]</div> </body></html>