EVOLUTION-MANAGER
Edit File: strength.html
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><title>R: Strength or weighted vertex degree</title> <meta http-equiv="Content-Type" content="text/html; charset=utf-8" /> <link rel="stylesheet" type="text/css" href="R.css" /> </head><body> <table width="100%" summary="page for strength {igraph}"><tr><td>strength {igraph}</td><td style="text-align: right;">R Documentation</td></tr></table> <h2>Strength or weighted vertex degree</h2> <h3>Description</h3> <p>Summing up the edge weights of the adjacent edges for each vertex. </p> <h3>Usage</h3> <pre> strength( graph, vids = V(graph), mode = c("all", "out", "in", "total"), loops = TRUE, weights = NULL ) </pre> <h3>Arguments</h3> <table summary="R argblock"> <tr valign="top"><td><code>graph</code></td> <td> <p>The input graph.</p> </td></tr> <tr valign="top"><td><code>vids</code></td> <td> <p>The vertices for which the strength will be calculated.</p> </td></tr> <tr valign="top"><td><code>mode</code></td> <td> <p>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.</p> </td></tr> <tr valign="top"><td><code>loops</code></td> <td> <p>Logical; whether the loop edges are also counted.</p> </td></tr> <tr valign="top"><td><code>weights</code></td> <td> <p>Weight vector. If the graph has a <code>weight</code> edge attribute, then this is used by default. If the graph does not have a <code>weight</code> edge attribute and this argument is <code>NULL</code>, then a warning is given and <code><a href="degree.html">degree</a></code> is called.</p> </td></tr> </table> <h3>Value</h3> <p>A numeric vector giving the strength of the vertices. </p> <h3>Author(s)</h3> <p>Gabor Csardi <a href="mailto:csardi.gabor@gmail.com">csardi.gabor@gmail.com</a> </p> <h3>References</h3> <p>Alain Barrat, Marc Barthelemy, Romualdo Pastor-Satorras, Alessandro Vespignani: The architecture of complex weighted networks, Proc. Natl. Acad. Sci. USA 101, 3747 (2004) </p> <h3>See Also</h3> <p><code><a href="degree.html">degree</a></code> for the unweighted version. </p> <h3>Examples</h3> <pre> 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) </pre> <hr /><div style="text-align: center;">[Package <em>igraph</em> version 1.3.5 <a href="00Index.html">Index</a>]</div> </body></html>