Returns TRUE iff the specified graphs are connected.
is.connected(g, connected = "strong", comp.dist.precomp = NULL)TRUE iff g is connected, otherwise FALSE
one or more input graphs.
definition of connectedness to use; must be one of "strong", "weak", "unilateral", or "recursive".
a component.dist object precomputed for the graph to be analyzed (optional).
Carter T. Butts buttsc@uci.edu
is.connected determines whether the elements of g are connected under the definition specified in connected. (See component.dist for details.) Since is.connected is really just a wrapper for component.dist, an object created with the latter can be supplied (via comp.dist.precomp) to speed computation.
West, D.B. (1996). Introduction to Graph Theory. Upper Saddle River, N.J.: Prentice Hall.
component.dist, components
#Generate two graphs:
g1<-rgraph(10,tp=0.1)
g2<-rgraph(10)
#Check for connectedness
is.connected(g1) #Probably not
is.connected(g2) #Probably so
Run the code above in your browser using DataLab