clusters {igraph}R Documentation

Connected components of a graph


Calculate the maximal (weakly or strongly) connected components of a graph


is.connected(graph, mode=c("weak", "strong"))
clusters(graph, mode=c("weak", "strong"))
no.clusters(graph, mode=c("weak", "strong"))
cluster.distribution(graph, cumulative = FALSE, mul.size = FALSE, ...)


graph The graph to analyze.
mode Character string, either “weak” or “strong”. For directed graphs “weak” implies weakly, “strong” strongly connected components to search. It is ignored for undirected graphs.
cumulative Logical, if TRUE the cumulative distirubution (relative frequency) is calculated.
mul.size Logical. If TRUE the relative frequencies will be multiplied by the cluster sizes.
... Additional attributes to pass to cluster, right now only mode makes sense.


is.connected decides whether the graph is weakly or strongly connected.

clusters finds the maximal (weakly or strongly) connected components of a graph.

no.clusters does almost the same as clusters but returns only the number of clusters found instead of returning the actual clusters.

cluster.distribution creates a histogram for the maximal connected component sizes.

Breadth-first search is conducted from each not-yet visited vertex.


For is.connected a logical constant.
For clusters a named list with three components:

membership numeric vector giving the cluster id to which each vertex belongs.
csize numeric vector giving the sizes of the clusters.
no numeric constant, the number of clusters.

For no.clusters an integer constant is returned.
For cluster.distribution a numeric vector with the relative frequencies. The length of the vector is the number of components.


Gabor Csardi

See Also



g <-, 1/20)

[Package igraph version 0.5.1 Index]