A function that returns degrees of nodes from provided “nodelist” and “edgelist”; while in-degrees and out-degrees are returned if edges are directed).
Degree.list(nodelist, edgelist, Directed=F)Lists of different contents are returned for undirected and directed edges respectively: For undirected graph:
An integer vector of degrees for each node in the given “nodelist”
For directed type:
An integer vector of In-degrees for each node in the given “nodelist”
An integer vector of Out-degrees for each node in the given “nodelist”
A “nodelist” object
An “edgelist” object
TRUE if edges are directed; FALSE, otherwise
Binbin Lu binbinlu@whu.edu.cn