reso: Apply the RESO algorithm to a graph

Description Usage Arguments Details Value References Examples

View source: R/reso.R

Description

Apply the RESO algorithm to a graph

Usage

1
reso(g, type = "weak")

Arguments

g

an igraph graph

type

connectedness type for directed graphs : "weak" or "strong". Ignored for undirected graphs

Details

See the reference article for details and explanations about the algorithm.

Value

Character vector with each vertex group. Groups are given in the form XX_YY, where XX is the type of group ("WP" for weak points, "1-AP" for 1-order articulation points, "CC" for connected components, and "CCsing" for singleton connected components), and YY the level of the group (the iteration during which the group has been produced).

References

Monique Dalud-Vincent, Michel Fors<c3><a9>, Jean-Paul Auray, "An algorithm for finding the structure of social groups", Social Networks, 16 (1994) 137-162.

Examples

1
2
3
4
5
## Random graph
g <- igraph::sample_gnp(14, 0.35)
plot(g)
res <- reso(g)
plot_reso(g, res)

juba/reso documentation built on May 18, 2017, 11:54 a.m.