ap_wp: Find Articulation points and weak point of a graph

In juba/reso: Implementation of the RESO Graph Decomposition Algorithm

Description

Find the articulation points (AP), the 1-order articulation points (1-AP) and weak points of a graph.

Usage

ap_wp(g, type = "weak")

Arguments

g	a connected igraph graph
type	connectedness type for directed graphs : "weak" or "strong". Ignored for undirected graphs

Details

Articulation points are determined with the articulation_points function.

A 1-order articulation point is an articulation point which generates a component of cardinal 1 when removed.

A weak point is a singleton component of a graph when one of its 1-order articulation points is removed.

Value

A list with 3 elements :

• ap is a character vector of articulation points names

• ap_1 is a character vector of 1-order articulation points names

• wp is a character vector of weak points names

References

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

juba/reso documentation built on May 20, 2019, 3:19 a.m.