Description Usage Arguments Details Value Author(s) See Also Examples

Articuation points or cut vertices are vertices whose removal increases the number of connected components in a graph.

1 |

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

Articuation points or cut vertices are vertices 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 makes it undirected. If a graph contains no articulation points, then its vertex connectivity is at least two.

A numeric vector giving the vertex ids of the articulation points of the input graph.

Gabor Csardi csardi.gabor@gmail.com

`biconnected_components`

, `components`

,
`is_connected`

, `vertex_connectivity`

1 2 3 4 | ```
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)
``` |

Questions? Problems? Suggestions? Tweet to @rdrrHQ or email at ian@mutexlabs.com.

Please suggest features or report bugs in the GitHub issue tracker.

All documentation is copyright its authors; we didn't write any of that.

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.