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

1 | ```
rank.nodes(gemat, type = "both")
``` |

`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; |

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

Youhua Chen <haydi@126.com>

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

`node.similarity`

,
`nmds.ordination`

1 2 3 4 | ```
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")
``` |

Questions? Problems? Suggestions? Tweet to @rdrrHQ or email at ian@mutexlabs.com.

Please suggest features or report bugs with the GitHub issue tracker.

All documentation is copyright its authors; we didn't write any of that.