Description Usage Arguments Value Author(s)
group.mreach.degree
computes the size of the reachable nodes from a particular node within M steps.
1 2  group.mreach.degree(adj.matrix, nodes, M = Inf, method = "min",
binary = TRUE, cmode = "total", large = TRUE, geodist.precomp = NULL)

adj.matrix 
Matrix indicating the adjacency matrix of the network. 
nodes 
Integer indicating the column index of the chosen player
in the adjacenncy matrix. If there are multiple players,
use 
M 
Number indicating the maximum distance between two nodes,
above which the two nodes are considered disconnected.
m hence defines a reachable set. The default is 
method 
Indication of which grouping criterion should be used.

binary 
If 
cmode 
String indicating the type of centrality being evaluated.
The default is to report the total degree.

large 
Logical scalar, whether the computation method for large network is
implemented. If 
geodist.precomp 
Geodistance precomputed for the graph to be analyzed (optional). 
A vector indicating the outdegree, indegree, or totaldegree mreach.degree score of the chosen player(s); or a data frame containing all the above information.
Weihua An [email protected]; YuHsin Liu [email protected]
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.