EVOLUTION-MANAGER
Edit File: articulation_points.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: Articulation points and bridges of a graph</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 articulation_points {igraph}"><tr><td>articulation_points {igraph}</td><td style="text-align: right;">R Documentation</td></tr></table> <h2>Articulation points and bridges of a graph</h2> <h3>Description</h3> <p><code>articulation_points</code> finds the articulation points (or cut vertices) </p> <h3>Usage</h3> <pre> articulation_points(graph) bridges(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>Articulation points or cut vertices are vertices whose removal increases the number of connected components in a graph. Similarly, bridges or cut-edges are edges whose removal increases the number of connected components in a graph. If the original graph was connected, then the removal of a single articulation point or a single bridge makes it undirected. If a graph contains no articulation points, then its vertex connectivity is at least two. </p> <h3>Value</h3> <p>For <code>articulation_points</code>, a numeric vector giving the vertex IDs of the articulation points of the input graph. For <code>bridges</code>, a numeric vector giving the edge IDs of the bridges of the input graph. </p> <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="biconnected_components.html">biconnected_components</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>, <code><a href="edge_connectivity.html">edge_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(match(1, clu), match(2, clu)) ) articulation_points(g) g <- make_graph("krackhardt_kite") bridges(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>