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

not including self-loop (i.e., the node itself as a chain)

1 | ```
shortest.chain(gemat, sp)
``` |

`gemat` |
standard square graph matrix |

`sp` |
the node/species you want to search |

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.

`longest.chain`

,
`largest.weight`

,
`smallest.weight`

,
`lclw`

1 2 | ```
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)
shortest.chain(gemat=mat,sp=4)
``` |

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.