Description Usage Arguments Details Value Author(s) References See Also Examples
graph matrix form is a square matrix in which each element a(ij) denotes the weight of a direction from a row entry (row i) to a column entry (column j)
1 | convertion(gemat)
|
gemat |
the square graph matrix |
each element must be larger (a weighted link) or equal to zero (no link)
graph edge matrix with first column meaning the starting points, the second column denoting the ending points, the last column denotes the weights for the links.
Youhua Chen <haydi@126.com>
Sun L, Wang M (2007) An algorithm for a decomposition of weighted digraphs: with applications to life cycle analysis in Ecology. Journal of Mathematical Biology, 54, 199-226.
Chen Y (2012) loop: an R package for performing decomposition of weighted directed graphs, food web analysis and flexible network plotting. Submitted.
decomp
,
gplot
,
loop.forward
,
loop.random
1 2 | mat=matrix(c(13,26,0,11,18,15,15,0,2),nrow=3,ncol=3)
convertion(gemat=mat)
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.