Character constant giving the type of the components,
wither weak for weakly connected components or strong
for strongly connected components.
max.comps
The maximum number of components to return. The first
max.comps components will be returned (which hold at least
min.vertices vertices, see the next parameter), the others
will be ignored. Supply NA here
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.
Value
A list of graph objects.
concept
Graph decomposition
Graph component
See Also
is.connected to decide whether a graph is
connected, clusters to calculate the connected
components of a graph.
# the diameter of each component in a random graphg <- erdos.renyi.game(1000, 1/1000)
comps <- decompose.graph(g, min.vertices=2)
sapply(comps, diameter)