articulation_points | R Documentation |

`articulation_points`

finds the articulation points (or cut vertices)

articulation_points(graph) bridges(graph)

`graph` |
The input graph. It is treated as an undirected graph, even if it is directed. |

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.

For `articulation_points`

, a numeric vector giving the vertex
IDs of the articulation points of the input graph. For `bridges`

, a
numeric vector giving the edge IDs of the bridges of the input graph.

Gabor Csardi csardi.gabor@gmail.com

`biconnected_components`

, `components`

,
`is_connected`

, `vertex_connectivity`

,
`edge_connectivity`

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)

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.