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

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

1 2 3 4 5 6 7 |

`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 |

A numeric vector giving the strength of the vertices.

Gabor Csardi csardi.gabor@gmail.com

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

`degree`

for the unweighted version.

1 2 3 4 5 6 7 8 9 |

Embedding an R snippet on your website

Add the following code to your website.

For more information on customizing the embed code, read Embedding Snippets.