rank.nodes: rank nodes based on the inward links/outward links/both links

In loop: loop decomposition of weighted directed graphs for life cycle analysis, providing flexbile network plotting methods, and analyzing food chain properties in ecology

Description

rank each node in the graph based on their connection status with other nodes, the standard is the inward/outward link numbers.

Usage

rank.nodes(gemat, type = "both")

Arguments

gemat	standard square graph matrix
type	if type="both", the function will rank the nodes based on total link number, by counting both inward and outward links for each node; if type="in", the function will rank the nodes based on inward link number for each node; if type="out", the function will rank the nodes based on outward link number for each node;

Value

return the sorted node vector in decreasing form with names showing the nodes,while the vector elements are the link numbers.

Author(s)

Youhua Chen <[e-mail]>

References

Chen Y (2012) loop: an R package for performing decomposition of weighted directed graphs, food web analysis and flexible network plotting. Submitted.

See Also

node.similarity, nmds.ordination

Examples

mat=matrix(c(0,5,3,7,0,5,0,8,0,4,3,8,0,1,6,7,0,1,0,2,0,4,6,2,0),5,5)
rank.nodes(gemat=mat,type="in")
rank.nodes(gemat=mat,type="out")
rank.nodes(gemat=mat,type="both")

loop documentation built on May 2, 2019, 9:07 a.m.