Description Usage Arguments Value Author(s) References See Also Examples
Sometimes for a given species, it has many food chains that are equal in chain lengths and all are longest. This function thus will find out the one with largest weight.
1 | lclw(gemat, sp)
|
gemat |
standard square graph matrix |
sp |
the node/species you want to search |
return the pathways and corresponding weights in a list
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.
shortest.chain
,
largest.weight
,
smallest.weight
,
longest.chain
1 2 3 4 5 6 | #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)
#search for species 3
#lclw(gemat=mat,sp=3)
#longest chain isn't necessary to have largest weights
#largest.weight(gemat=mat,sp=3)
#longest.chain(gemat=mat,sp=3)
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.