Find the Number of (Maximal) Components Within a Given Graph
Returns the number of components within dat, using the connectedness rule given in connected.
components(dat, connected="strong", comp.dist.precomp=NULL)
dat |
one or more input graphs. |
connected |
the the component definition to be used by |
comp.dist.precomp |
a component size distribution object from |
The connected parameter corresponds to the rule parameter of component.dist. By default, components returns the number of strong components, but other component types can be returned if so desired. (See component.dist for details.) For symmetric matrices, this is obviously a moot point.
A vector containing the number of components for each graph in dat
Carter T. Butts buttsc@uci.edu
West, D.B. (1996). Introduction to Graph Theory. Upper Saddle River, NJ: Prentice Hall.
g<-rgraph(20,tprob=0.05) #Generate a sparse random graph #Find weak components components(g,connected="weak") #Find strong components components(g,connected="strong")
Please choose more modern alternatives, such as Google Chrome or Mozilla Firefox.