Sometimes the longest chain is not unique, thus will return all candidates with longest length
standard square graph matrix
the node/species you want to search
Youhua Chen <email@example.com>
Chen Y (2012) loop: an R package for performing decomposition of weighted directed graphs, food web analysis and flexible network plotting. Submitted.
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)