loop.random: a random method to decompose the weighted graph into single...

Description Usage Arguments Author(s) References See Also

View source: R/loop.R

Description

At each step, a random one of all candidate nodes was chosen when finding next node in the process of making a single connected graph. This method can allow us to obtain different decomposition results possibly. In contrast, the method used in 'loop.forward' function will always return only one possibility of decomposition. This algorithm is the one employed in the function 'decomp'. Next version will use function 'uniquepaths' to get all possible decompositions at the same time.

Usage

1
loop.random(gemat)

Arguments

gemat

square graph matrix

Author(s)

Youhua Chen <haydi@126.com>

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

decomp, gplot, gplot1, loop.forward


loop documentation built on May 29, 2017, 11:20 p.m.

Search within the loop package
Search all R packages, documentation and source code