Apply the RESO algorithm to a graph
an igraph graph
connectedness type for directed graphs : "weak" or "strong". Ignored for undirected graphs
See the reference article for details and explanations about the algorithm.
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).
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.
1 2 3 4 5
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.