Articulation points of a graph

Share:

Description

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

Usage

1

Arguments

graph

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

Details

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.

Value

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

Author(s)

Gabor Csardi csardi.gabor@gmail.com

See Also

biconnected_components, components, is_connected, vertex_connectivity

Examples

1
2
3
4

Want to suggest features or report bugs for rdrr.io? Use the GitHub issue tracker.