1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
|
% Generated by roxygen2: do not edit by hand
% Please edit documentation in R/components.R
\name{articulation_points}
\alias{articulation_points}
\alias{articulation.points}
\title{Articulation points of a graph}
\usage{
articulation_points(graph)
}
\arguments{
\item{graph}{The input graph. It is treated as an undirected graph, even if
it is directed.}
}
\value{
A numeric vector giving the vertex ids of the articulation points of
the input graph.
}
\description{
Articuation points or cut vertices are vertices whose removal increases the
number of connected components in a graph.
}
\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.
}
\examples{
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)
}
\seealso{
\code{\link{biconnected_components}}, \code{\link{components}},
\code{\link{is_connected}}, \code{\link{vertex_connectivity}}
}
\author{
Gabor Csardi \email{csardi.gabor@gmail.com}
}
\keyword{graphs}
|
