strength: Strength or weighted vertex degree

Description Usage Arguments Value Author(s) References See Also Examples

View source: R/auto.R

Description

Summing up the edge weights of the adjacent edges for each vertex.

Usage

1
2
strength(graph, vids = V(graph), mode = c("all", "out", "in", "total"),
  loops = TRUE, weights = NULL)

Arguments

graph

The input graph.

vids

The vertices for which the strength will be calculated.

mode

Character string, “out” for out-degree, “in” for in-degree or “all” for the sum of the two. For undirected graphs this argument is ignored.

loops

Logical; whether the loop edges are also counted.

weights

Weight vector. If the graph has a weight edge attribute, then this is used by default. If the graph does not have a weight edge attribute and this argument is NULL, then a warning is given and degree is called.

Value

A numeric vector giving the strength of the vertices.

Author(s)

Gabor Csardi [email protected]

References

Alain Barrat, Marc Barthelemy, Romualdo Pastor-Satorras, Alessandro Vespignani: The architecture of complex weighted networks, Proc. Natl. Acad. Sci. USA 101, 3747 (2004)

See Also

degree for the unweighted version.

Examples

1
2
3
4
5
6
7
8
9
g <- make_star(10)
E(g)$weight <- seq(ecount(g))
strength(g)
strength(g, mode="out")
strength(g, mode="in")

# No weights, a warning is given
g <- make_ring(10)
strength(g)

igraph documentation built on Jan. 11, 2020, 9:18 a.m.