Description Usage Arguments Value Author(s) See Also Examples
Creates a separate graph for each component of a graph.
1 2 
graph 
The original graph. 
mode 
Character constant giving the type of the components, wither

max.comps 
The maximum number of components to return. The first

min.vertices 
The minimum number of vertices a component should contain in order to place it in the result list. Eg. supply 2 here to ignore isolate vertices. 
A list of graph objects.
Gabor Csardi [email protected]
is_connected
to decide whether a graph is connected,
components
to calculate the connected components of a graph.
1 2 3 4  # the diameter of each component in a random graph
g < sample_gnp(1000, 1/1000)
components < decompose(g, min.vertices=2)
sapply(components, diameter)

Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.