| is.connected {sna} | R Documentation |
Returns TRUE iff the specified graphs are connected.
is.connected(g, connected = "strong", comp.dist.precomp = NULL)
g |
one or more input graphs. |
connected |
definition of connectedness to use; must be one of "strong", "weak", "unilateral", or "recursive". |
comp.dist.precomp |
a component.dist object precomputed for the graph to be analyzed (optional). |
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.
TRUE iff g is connected, otherwise FALSE
Carter T. Butts buttsc@uci.edu
West, D.B. (1996). Introduction to Graph Theory. Upper Saddle River, N.J.: Prentice Hall.
#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