View source: R/met.indegree.single.R
| met.indegree.single | R Documentation | 
Calculate for all the vertices the node metric call met.indegree.
met.indegree.single(M, df = NULL, dfid = NULL)
M | 
 a square adjacency matrix.  | 
df | 
 a data frame of same length of the input matrix.  | 
dfid | 
 an integer indicating the column of individual ids in argument df  | 
met.indegree of vertice i is the number of all edges receive by node i.
Integer vector of each vertices met.indegree.
Sebastian Sosa, Ivan Puga-Gonzalez.
Barrat, A., Barthelemy, M., Pastor-Satorras, R., & Vespignani, A. (2004). The architecture of complex weighted networks. Proceedings of the National Academy of Sciences of the United States of America, 101(11), 3747-3752.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.