decomp: decompose the weighted graph into directional single...

In loop: loop decomposition of weighted directed graphs for life cycle analysis, providing flexbile network plotting methods, and analyzing food chain properties in ecology

Description

It will return all connected graphs, and a unconnected graph

Usage

decomp(gemat)

Arguments

gemat

the square graph matrix

Value

return all single connected directed graphs and a final non-decomposable graph

Author(s)

Youhua Chen <[e-mail]>

References

van Groenendael J, de Kroon H, Kalisz S, Tuljapurkar S (1994) Loop analysis: evaluating life history pathways in population projection matrices. Ecology, 75, 2410-2415.

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.

See Also

gplot, fplot, fplot.foodweb, loop.forward, loop.random

Examples

mat=matrix(c(13,26,0,12,18,15,15,0,2),nrow=3,ncol=3)
#search out all loops
decomp(gemat=mat)

Example output

Loading required package: grid
Loading required package: MASS
[[1]]
     [,1] [,2] [,3]
[1,]   13    0    0
[2,]    0    0    0
[3,]    0    0    0

[[2]]
     [,1] [,2] [,3]
[1,]    0   12    0
[2,]   12    0    0
[3,]    0    0    0

[[3]]
     [,1] [,2] [,3]
[1,]    0    0   14
[2,]   14    0    0
[3,]    0   14    0

[[4]]
     [,1] [,2] [,3]
[1,]    0    0    0
[2,]    0   18    0
[3,]    0    0    0

[[5]]
     [,1] [,2] [,3]
[1,]    0    0    0
[2,]    0    0    0
[3,]    0    0    2

[[6]]
     [,1] [,2] [,3]
[1,]    0    0    1
[2,]    0    0    0
[3,]    0    1    0

loop documentation built on May 2, 2019, 9:07 a.m.