Connectivity components of an undirected graph
Computes the connectivity components of an undirected graph from a matrix giving the edges.
con.comp(comat)
comat |
a symmetric logical or 0-1 matrix, where |
The "depth-first search" algorithm of Cormen, Leiserson and Rivest (1990, p. 477) is used.
An integer vector, giving the number of the connectivity component for each vertice.
Cormen, T. H., Leiserson, C. E. and Rivest, R. L. (1990), Introduction to Algorithms, Cambridge: MIT Press.
set.seed(1000)
x <- rnorm(20)
m <- matrix(0,nrow=20,ncol=20)
for(i in 1:20)
for(j in 1:20)
m[i,j] <- abs(x[i]-x[j])
d <- m<0.2
cc <- con.comp(d)
max(cc) # number of connectivity components
plot(x,cc)
# The same should be produced by
# cutree(hclust(as.dist(m),method="single"),h=0.2).Please choose more modern alternatives, such as Google Chrome or Mozilla Firefox.